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.
Algorithm 447: efficient algorithms for graph manipulation. J Hopcroft, R Tarjan. Communications of the ACM 16 (6), 372-378. , 1973. 1568. 1973. An n log n algorithm for minimizing states in a finite automaton. J Hopcroft. Theory of machines and computations, 189-196.
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.
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.”
This book covers the basic concepts and methods of data science, such as high-dimensional geometry, singular value decomposition, random walks, Markov chains, and graph algorithms. It is written by John Hopcroft, a pioneer of theoretical computer science and a Turing Award winner.
Feb 1, 2016 · Through pioneering research and wide-reaching textbooks, John Hopcroft and Jeffrey D. Ullman are known as two of the most influential figures responsible for shaping the field of computer science.
