Tripti Joshi (Editor)

John Hopcroft

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality
  
American

Fields
  
Computer Science

Role
  
Computer scientist

Name
  
John Hopcroft


John Hopcroft 40th Ann Symposium CSCornell

Born
  
October 7, 1939 (age 84) Seattle, Washington (
1939-10-07
)

Institutions
  
Cornell University, Princeton University, Stanford University

Alma mater
  
Seattle University, Stanford University

Thesis
  
Synthesis of Threshold Logic Networks (1964)

Doctoral students
  
Alfred Aho Chandrajit Bajaj Gilles Brassard Cynthia Dwork Zvi Galil Daniela L. Rus

Books
  
Introduction to Automata Theory, Languages, and Computation

Education
  
Stanford University (1964), Stanford University (1962), Seattle University (1961)

Awards
  
Turing Award, IEEE John von Neumann Medal

Notable students
  
Alfred Aho, Zvi Galil, Chandrajit Bajaj

Similar People
  
Jeffrey Ullman, Alfred Aho, Rajeev Motwani, Robert Tarjan, Sheila Greibach

Doctoral advisor
  
Richard Lewis Mattson

Cs distinguished lecture john hopcroft


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.

Contents

Education

John Hopcroft xiaozhangbangongshi

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 at Cornell University. John Hopcroft is the grandson of Jacob Nist, founder of the Seattle-Tacoma Box Company.

Career

John Hopcroft wwwcscornelledujehimagesHopcroftIjpg

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.

John Hopcroft John Hopcroft

In 1986 he received the Turing Award (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." 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."

John Hopcroft

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

John Hopcroft John E Hopcroft Heidelberg Laureate Forum

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.

John Hopcroft Turing Prize winner John Hopcroft gives a lecturePeking

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.”

Awards

  • 1986. Turing Award
  • 1994. ACM Fellow
  • 2005. Harry H. Goode Memorial Award
  • 2008. Karl Karlstrom Outstanding Educator Award
  • 2010. IEEE John von Neumann Medal
  • References

    John Hopcroft Wikipedia