1986年的图灵奖获得者-John E. Hopcroft

John E. Hopcroft (10/07/1939--)

图 灵 奖 获 得 时 间 ：

1986年 。 第二十一位 图 灵 奖 (1986年 ) 获 得 者 。

 

图 灵 奖 引 用 (Turing Award Citation) ：

 

Citation

For fundamental achievements in the design and analysis of algorithms and data structures.

 

中 文 翻 译 ：

( 授 予 John E. Hopcroft图 灵 奖 以 表 彰 其在) 数据结构和算法设计与分析领域的重要的基础性的贡献。

 

编 者 注 ：

 

Hopcroft撰写的计算理论，数据结构，算法分析方面的书籍：

 

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

John Hopcroft发表的一些重要学术论文：

 

• J. E. Hopcroft and J. D. Ullman. Decidable and undecidable questions about automata. Journal of the ACM, 15(2):317-324, April 1968. References and Citations.
• John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape complexities. Journal of the ACM, 15(3):414-427, July 1968. References and Citations.
• J. E. Hopcroft and J. D. Ullman. Some results on tape-bounded Turing machines. Journal of the ACM, 16(1):168-177, January 1969. References, Citations, etc.
• Seymour Ginsburg and John Hopcroft. Two-way balloon automata and AFL. Journal of the ACM, 17(1):3-13, January 1970. References, etc.
• J. Hartmanis and J. E. Hopcroft. An overview of the theory of computational complexity. Journal of the ACM, 18(3):444-475, July 1971. References, Citations, etc.
• John Hopcroft and Robert Tarjan. Efficient planarity testing. Journal of the ACM, 21(4):549-568, October 1974. References, Citations, etc.
• John Hopcroft, Wolfgang Paul, and Leslie Valiant. On time versus space. Journal of the ACM, 24(2):332-337, April 1977. Citations.

算法分析：

http://www.algorithmist.com/index.php/Main_Page

http://en.wikipedia.org/wiki/Analysis_of_algorithms

http://en.wikipedia.org/wiki/Algorithm

http://www.eecs.harvard.edu/~ellard/Q-97/HTML/root/node8.html

Big-O Notation: http://en.wikipedia.org/wiki/Big_O_notation

 

Turing Award Lecture(图灵奖演讲文章)：

 

Computer Science: The Emergence of a Discipline. Commun. ACM 30(3): 198-202(1987)

 

John E. Hopcroft简 介 :

 

Hopcroft在康乃尔大学(www.cornell.edu  )的主页: http://www.cs.cornell.edu/jeh/

Hopecroft Wiki:  http://en.wikipedia.org/wiki/John_Hopcroft

 

John E. Hopcroft于1939年10月7日出生。

 

Hopcroft于1961年从西雅图大学(Seattle University: www.seattleu.edu)

获得其电子工程的学士学位。1962年和1964年在斯坦福大学获得其电子工程专业的硕士和博士学位。

 

1964年到1967年，Hopcroft在普林斯顿大学(www.princeton.edu)担任助理教授一职。

然后，Hopcrosft基本上就一直出任Cornell大学工学院的教授，院长，计算机系的教授等职位。

 

Hopcroft获得过许多学术荣誉，可参见：

 

Honors (awards, medals, prizes, offices held in professional societies, with years):
2005- IEEE Harry H. Goode Memorial Award
2004- IBM Professor of Engineering and Applied Mathematics
1994- Fellow of the Association for Computing Machinery
1990 Doctor of Humanities Degree, Honoris Causa, Seattle University
1989- Member of the National Academy of Engineering
1987- Fellow of the Institute of Electrical and Electronics Engineering
1987- Fellow of the American Association for the Advancement of Science
1987- Fellow of the American Academy of Arts and Sciences
1986 Association for Computing Machinery A.M. Turing Award (shared with R.J. Tarjan)
1985-1993 Joseph C. Ford Professor of Computer Science
1961-1964 National Science Foundation Graduate Fellow

 

John E. Hopcroft照片:

 

http://images.google.com/images?q=john+E.hopcroft&hl=en&lr=&sa=N&tab=wi&sourceid=tipimg

 

 

 

(John Hopcroft, Left)

转自http://www.xtrj.org/