John Hopcroft

From Wikipedia, the free encyclopedia
  (Redirected from John E. Hopcroft)
Jump to: navigation, search
John Edward Hopcroft
Hopcrofg.jpg
Born (1939-10-07) October 7, 1939 (age 74)
Seattle, Washington
Nationality American
Fields Computer Science
Institutions Cornell University, Princeton University, Stanford University
Alma mater Seattle University, Stanford University
Thesis Synthesis of Threshold Logic Networks (1964)
Doctoral advisor Richard Lewis Mattson[1]
Doctoral students
Notable awards Turing Award (1986)
Harry H. Goode Memorial Award (2005)
IEEE John von Neumann Medal (2010)
Website
www.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 the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University.[2][3]

Education[edit]

He received his master's degree and Ph.D. from Stanford University in 1962 and 1964, respectively. He worked for three years at Princeton University and since then has been based at Cornell University. John Hopcroft is the grandson of Jacob Nist, founder of the Seattle Box Company.

Career[edit]

In addition to his research work, he is well known for his books on algorithms and formal languages coauthored with Jeffrey Ullman and Alfred Aho, regarded as classic texts in the field.

In 1986 he received the Turing Award, the most prestigious award in the field and often recognized as the "Nobel Prize of computing"[4] (jointly with Robert Tarjan) "for fundamental achievements in the design and analysis of algorithms and data structures." Along with his work with Tarjan on planar graphs he is also known for the Hopcroft–Karp algorithm for finding matchings in bipartite graphs. In 1994 he was inducted as a Fellow of the Association for Computing Machinery. In 2005 he received the Harry H. Goode Memorial Award "for fundamental contributions to the study of algorithms and their applications in information processing."[5] In 2008 he received the Karl V. Karlstrom Outstanding Educator Award "for his vision of and impact on computer science, including co-authoring field-defining texts on theory and algorithms, which continue to influence students 40 years later, advising PhD students who themselves are now contributing greatly to computer science, and providing influential leadership in computer science research and education at the national and international level." [6]

In 1992 John Hopcroft was nominated to the National Science Board by George H.W. Bush.

In 2005, he was awarded an honorary doctorate by the University of Sydney, in Sydney, Australia. In 2009, he received an honorary doctorate from Saint Petersburg State University of Information Technologies, Mechanics and Optics.[7]

Hopcroft is also the co-recipient (with Jeffrey Ullman) of the 2010 IEEE John von Neumann Medal “for laying the foundations for the fields of automata and language theory and many seminal contributions to theoretical computer science.”[8]

Bibliography[edit]

  • J.E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation Second Edition. Addison-Wesley (2001).
  • Alfred V. Aho, J.E. Hopcroft, Jeffrey D. Ullman, Data Structures and Algorithms, Addison-Wesley Series in Computer Science and Information Processing. (1983)
  • Alfred V. Aho, J.E. Hopcroft, Jeffrey D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Series in Computer Science and Information Processing (1974).

References[edit]