Seattle University (BS) Stanford University (MS, PhD)
Awards
Turing Award (1986)
Member of the National Academy of Sciences
Member of the National Academy of Engineering
Foreign Member of the Chinese Academy of Sciences
Fellow of the American Academy of Arts and Sciences
Fellow of the American Association for the Advancement of Science
Fellow of the Institute of Electrical and Electronics Engineers
Fellow of the Association for Computing Machinery
Scientific career
Fields
Computer science
Institutions
Stanford University
Princeton University
Cornell University
Thesis
Synthesis of Threshold Logic Networks(1964)
Doctoral advisor
Richard Mattson
Doctoral students
Alfred Aho
Chandrajit Bajaj
Gilles Brassard
Richard J. Cole
Cynthia Dwork
Zvi Galil
Daniela L. Rus
Website
cs.cornell.edu/jeh
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. He is a professor emeritus at Cornell University,[1][2] co-director of the Center on Frontiers of Computing Studies at Peking University,[3] and the director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.[4]
^John E. Hopcroft at DBLP Bibliography Server
^John Hopcroft author profile page at the ACM Digital Library
^"People - Center on Frontiers of Computing Studies". Peking University.
^"Members - John Hopcroft Center". Shanghai Jiao Tong University. Retrieved 9 November 2021.
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella...
Look up Hopcroft in Wiktionary, the free dictionary. Hopcroft is a surname. Notable people with the surname include: JohnHopcroft (born 1939), American...
her Ph.D. from Cornell University in 1983 for research supervised by JohnHopcroft. Dwork is known for her research placing privacy-preserving data analysis...
for university courses as well as industry references. In 1974, Aho, JohnHopcroft, and Ullman wrote The Design and Analysis of Computer Algorithms, codifying...
and Introduction to Automata Theory, Languages, and Computation with JohnHopcroft and Jeffrey Ullman. He was an avid angel investor and helped fund a...
operating system theory, and for developing Unix. 1986: Robert Tarjan with JohnHopcroft, for fundamental achievements in the design and analysis of algorithms...
Data Structures, Prentice Hall, 1985, ISBN 978-0130220059 Alfred Aho, JohnHopcroft, and Jeffrey Ullman, Data Structures and Algorithms, Addison-Wesley...
2013: Jack Dennis 2012: Edward J. McCluskey 2011: C. A. R. Hoare 2010: JohnHopcroft and Jeffrey Ullman 2009: Susan L. Graham 2008: Leslie Lamport 2007:...
Cornell University in 1979, working in the field of cryptography with JohnHopcroft as his advisor. Brassard is best known for his fundamental work in quantum...
complexity. The lowest common ancestor problem was defined by Alfred Aho, JohnHopcroft, and Jeffrey Ullman (1973), but Dov Harel and Robert Tarjan (1984) were...
Booth (1967) Sequential Machines and Automata Theory, John Wiley and Sons, New York. JohnHopcroft and Jeffrey Ullman (1979) Introduction to Automata Theory...
1969, all in electrical engineering. Professor at Stanford 1971–1996. JohnHopcroft: BS Seattle University; MS EE Stanford 1962, Phd EE Stanford 1964. Barbara...
awarded the Knuth Prize. Ullman is the co-recipient (with JohnHopcroft) of the 2010 IEEE John von Neumann Medal "For laying the foundations for the fields...
computer science at Cornell University in 1975 under the supervision of JohnHopcroft. He then spent a year working as a post-doctorate researcher at IBM's...
Archived from the original on July 4, 2017. Retrieved March 4, 2024. "John E. Hopcroft - A.M. Turing Award Laureate". Association for Computing Machinery...
computing biconnected components in a connected undirected graph is due to JohnHopcroft and Robert Tarjan (1973). It runs in linear time, and is based on depth-first...
described as the complex of sets of nonattacking rooks on a chessboard. JohnHopcroft and Robert Tarjan derived a means of testing the planarity of a graph...
1997. Introduction to Automata Theory, Languages, and Computation by JohnHopcroft and Jeffrey Ullman, an older textbook in the same field Fortnow, Lance...
Faculty Advisor for Digital Learning Strategy at UC Berkeley Professor John E. Hopcroft, NCI Fellow and IBM Professor of Engineering and Applied Mathematics...
Manuel Blum, 1995 Turing Award winner, and Lenore Blum. Blum, Avrim, JohnHopcroft, and Ravindran Kannan. "Foundations of Data Science," February 27, 2020...
director 1938 – Ann Jones, English tennis player and sportscaster 1939 – JohnHopcroft, American computer scientist and author 1939 – Clive James, Australian...
Kyoto Prize, winner of National Medal of Technology and Innovation JohnHopcroft (Ph.D. 1964 electrical engineering), Turing Award-winning computer scientist...
complexity of Moore's and Hopcroft's algorithms", Theoretical Computer Science, 417: 50–65, doi:10.1016/j.tcs.2011.10.011. Hopcroft, John (1971), "An n log n...
Global Information
