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 Professor Emeritus in Computer Science at Cornell University. From January 1994 until June 2001, he was the Joseph Silbert Dean of Engineering. After receiving both his M.S. (1962) and Ph.D. (1964) in electrical engineering from Stanford University, he spent three years on the faculty of Princeton University.
His work on formal languages and the analysis of algorithms has made John Hopcroft one of the handful of pioneering computer scientists who put the discipline on a firm theoretical foundation.
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.”
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 Professor Emeritus in Computer Science at Cornell University and Visiting Chair Professor, Director of CFCS, Turing Advisor at Peking University. From January...
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.
