计算的美丽 图灵奖第一个四十年（下）.PDFVIP

计算的美丽— 图灵奖第一个四十年（下） 陈怀临，首席科学家 《弯曲评论》 huailin@ 24. 计算的美丽–1986 年图灵奖获得者 John E. Hopcroft John E. Hopcroft(10/07/1939–) 图灵奖获得时间： 1986 年。 第二十一位图灵奖(1986 年)获得者。 图灵奖引用(Turing Award Citation) ： For fundamental achievements in the design and analysis of algorithms and data structures. 【笔者译：】 (授予 John E. Hopcroft 图灵奖以表彰其在)数据结构和算法设计与分析领域的重要的 基础性的贡献。 【笔者注：】 算法分析： /index.php/Main_Page /wiki/Analysis_of_algorithms /wiki/Algorithm /~ellard/Q-97/HTML/root/node8.html Big-O Notation: /wiki/Big_O_notation 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 T