 Richard Edwin Stearns(07/05/1936–)
图灵奖获得时间：
1993年 。 第二十八位图灵奖(1993年)获得者。
图灵奖引用(Turing Award Citation)：
In recognition of their seminal paper which established the foundations for the field of computational complexity theory.
【笔者译：】
( 授予Richard Stearns图灵奖以表彰其)在计算复杂性理论领域发表的具有开创意义的研究文章。
笔者注：
Stearns与Hartmanis合作的关于计算复杂性方面的经典论文：
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
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/FacultyStaff/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.
This book won the 1995 Lanchester Prize for the best contribution of the year to Operations Research.
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
Journal on Computing, 6, September 1977, pp. 563-581.
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.
|
