Resultado de búsqueda
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 (7 de octubre de 1939) es un conocido científico de la computación. Recibió su licenciatura por la Universidad de Seattle en 1961, y sus títulos de máster y doctorado por la Universidad de Stanford en 1962 y 1964, respectivamente.
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. Cornell University. Verified email at cs.cornell.edu - Homepage. Articles Cited by Public access Co-authors. Title. Sort. Sort by citations Sort by year Sort ... JE Hopcroft, KQ Weinberger. arXiv preprint arXiv:1704.00109, 2017. 1059: 2017: The directed subgraph homeomorphism problem. S Fortune, J Hopcroft, J Wyllie. Theoretical ...
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.”
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.
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.
