Search results
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella book) and data structures are regarded as standards in their fields.
John E. Hopcroft is a professor emeritus of computer science at Cornell University and a Turing Award winner. He has also served as the dean of engineering, the chair of computer science, and the IBM professor of engineering and applied mathematics.
John Hopcroft is a pioneer of computer science theory and a co-author of influential textbooks on formal languages and algorithms. He received the Turing Award in 1986 for his work with Robert Tarjan on graph algorithms and data structures.
May 1, 2024 · John Hopcroft (born October 7, 1939, Seattle, Washington, U.S.) is an American computer scientist and cowinner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”
- William L. Hosch
Algorithm 447: efficient algorithms for graph manipulation. J Hopcroft, R Tarjan. Communications of the ACM 16 (6), 372-378. , 1973. 1565. 1973. An n log n algorithm for minimizing states in a finite automaton. J Hopcroft. Theory of machines and computations, 189-196.
John E. Hopcroft is a renowned computer scientist and the IBM Professor of Engineering and Applied Mathematics at Cornell University. He is also the Director of the Center on Frontiers of Computing Studies (CFCS) at Peking University and a Turing Advisor there.
Feb 1, 2016 · It’s successor, Automata Theory, Languages, and Computation, is still in use today. Dr. Hopcroft is considered one of only a handful of computer scientists who created the discipline of theoretical computer science, unifying automata theory and formal languages during the late 1960s.
