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 (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 Edward Hopcroft），1939年10月7日出生于美国西雅图，计算机科学家，中国科学院外籍院士， 美国国家科学院院士 ， 美国国家工程院院士 ， 美国艺术与科学院院士 ，美国 康奈尔大学 教授，北京大学前沿计算研究中心主任。 [1] [6] [14] 约翰·霍普克罗夫特于1961年获得 西雅图大学 电子工程学士学位；1962年获得 斯坦福大学 电子工程硕士学位；1964年获得斯坦福大学电子工程博士学位；1987年当选为美国艺术与科学院院士；1989年当选为美国国家工程院院士；1994年—2001年任康奈尔大学工程学院院长 [11]；2009年当选为美国国家科学院院士；2017年当选为中国科学院外籍院士。 [1] [5-6]
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.
1 de may. de 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.”
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. 1029: 2017: The directed subgraph homeomorphism problem. S Fortune, J Hopcroft, J Wyllie. Theoretical ...
