Richard Edwin Stearns
图 灵 奖 获 得 时 间 :
1993年 。 第二十八位图 灵 奖 (1993年 ) 获 得 者 。
图 灵 奖 引 用 (Turing Award Citation) :
Citation:
In recognition of their seminal paper which established the foundations for the field of computational complexity theory.
中 文 翻 译 :
( 授 予Richard Stearns图 灵 奖 以表 彰其) 在计算复杂性理论领域发表的具有开创意义的研究文章。
编 者 注 :
Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285--306.
关于计算复杂性理论,可参见:
www.xtrj.org/ssm4/complexity_theory.htm
Computational Complexity of Games and Puzzles
IEEE Conference on Computational Complexity
Lecture Notes on Computational Complexity
Juris Hartmanis, Richard Stearns, and Computational Complexity.
Turing Award Lecture(图灵奖演讲文章):
It's Time to Reconsider Time. Commun. ACM 37(11): 95-99(1994)
Richard Edwin Stearns简 介 :
http://en.wikipedia.org/wiki/Richard_Stearns_%28computer_scientist%29
http://www.cs.albany.edu/profiles/res.html
Books |
Hartmanis, J. and Stearns, R.E., Algebraic Structure Theory of Sequential Machines, Prentice-Hall, 1966. |
Lewis, P.M., Rosenkrantz, D.J. and Stearns, R.E., Compiler Design Theory, Addison Wesley Publishing Co., 1976. |
Aumann, Robert J. and Maschler, Michael B. with the collaboration of Stearns, Richard E., Repeated Games with Incomplete Information, MIT Press, 1995. |
Selected Publications |
Hartmanis, J. and Stearns, R.E., On the Computational Complexity of Algorithms, Trans. Am. Math. Soc., vol. 117, #5, May 1965, 285-306. |
Lewis, P.M. and Stearns, R.E., Syntax-Directed Transduction, Journal of ACM, 15, July 1968, pp. 465-488. |
Stearns, R.E., Convergent Transfer Schemes for N-Person Games, Trans. Am. Math. Soc., 134, December 1968, pp. 449-459. |
Rosenkrantz, D.J., Stearns, R.E. and Lewis, P.M., An Analysis of Several Heuristics for the Traveling Salesman Problem, SIAM |
Rosenkrantz, D.J., Stearns, R.E. and Lewis, P.M., Consistency and Serializability in Concurrent Database Systems, SIAM Journal on Computing, 13, August 1984, pp. 508-530. |
Stearns, R.E. and Hunt III, H.B., Power Indices and Easier NP-complete Problems, Mathematical Systems Theory, 23, 1990, pp. 209-225. |
Stearns, Richard Edwin, It's Time to Reconsider Time, Communications of the ACM, 37, November 1994, pp. 95-99. |
Stearns, R.E. and Hunt III, H.B., An Algebraic Model for Combinatorial Problems, SIAM Journal on Computing, 25, April 1996, pp. 448-476. |
Stearns, R.E. and Hunt III, H.B.,Exploiting Structure in Quantified Formulas, Journal of Algorithms, 43, 2002, pp. 220-263. |
Richard Stearns照片:
转自http://www.xtrj.org/