John Hopcroft

From Wikipedia, the free encyclopedia

**John Edward Hopcroft**

Born	October 7, 1939 Seattle, Washington
Field	Computer Science
Institution	Cornell University
Notable prizes	Turing Award

John Edward Hopcroft (born October 7, 1939) is a renowned theoretical computer scientist.

He received his bachelor's degree from Seattle University in 1961 and his master's degree and Ph.D. from Stanford University in 1962 and 1964, respectively. He then worked for three years at Princeton University. He has since been based at Cornell University, where he is currently the IBM Professor of Engineering and Applied Mathematics in Computer Science.

He received the Turing Award--the most prestigious award in the field--jointly with Robert Tarjan in 1986. The citation states that he received the award "for fundamental achievements in the design and analysis of algorithms and data structures." In 1994 he was inducted as a Fellow of the Association for Computing Machinery.

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 is the grandson of Jacob Nist, founder of the Seattle Box Company.

[edit] Bibliography

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