Richard E. Stearns

from Wikipedia, the free encyclopedia

Richard Edwin "Dick" Stearns (born July 5, 1936 in Caldwell , New Jersey ) is an American computer scientist who received the Turing Award in 1993 together with Juris Hartmanis for his achievements in the field of complexity theory .

Richard E. Stearns (2009)


Stearns received his bachelor's degree in mathematics from Carleton College in 1958 , and in 1961 he received his doctorate in mathematics under Harold W. Kuhn at Princeton University on the game theory topic Three Person Cooperative Games Without Side Payments.

Before that, in the summer of 1960, he had worked with Juris Hartmanis in the research department of General Electric in Schenectady . He continued this activity in June 1961. In 1964 he and Hartmanis published the eponymous paper Computational complexity of recursive sequences (re-published in 1965 as On the computational complexity of algorithms ), which pioneered the complexity theory , in which they introduced DTIME and thus general complexity classes as well as an early speed-up theorem . Together with Phil Lewis, Stearns and Hartmanis introduced not only time but also space complexity in 1965 . It was only after this work that Stearns first came into contact with computers.

From September 1978 Stearns was at the University at Albany , where he headed the Faculty of Computer Science from January 1982 to August 1989. In 1994 he was honored as a Distinguished Professor and has been retired since September 2000.

In 1975 he was visiting professor at the Hebrew University of Jerusalem , from 1977 to 1978 adjunct professor at the Rensselaer Polytechnic Institute , and in 1985 visiting scholar at the Mathematical Sciences Research Institute of the University of California, Berkeley .

Stearns is married with two children.

He was a founding member of the Game Theory Society and is a Fellow of the ACM .

Awards and honors


  • with Juris Hartmanis : On the computational complexity of algorithms. In: Transactions of the American Mathematical Society. Vol. 117, 1965, pp. 285-306. Initially as the computational complexity of recursive sequences. In: Proceedings of the Fifth Annual IEEE Symposium on Switching Circuit Theory and Logical Design Princeton (NJ) 1964, pp. 82-90.
  • with Juris Hartmanis & Phil M. Lewis: Hierarchies of Memory Limited Computations. In: Proceedings of the Sixth Annual IEEE Symposium on Switching Circuit Theory and Logical Design. Ann Arbor (Mich.) 1965, pp. 179-190 ( PDF; 398 kB ).
  • with Frederick C. Hennie: Two-tape simulation of multi-tape turing machines. In: Journal of the ACM . Vol. 13, No. October 10, 1966, pp. 533-546.
  • with Harry B. Hunt: Power indices and easier hard problems. In: Mathematical Systems Theory. Vol. 23, 1990, pp. 209-225 ( PDF; 475 kB ).
  • It's time to reconsider time. In: Communications of the ACM . Vol. 37, No. 11, November 1994, pp. 95-99 ( PDF; 754 kB ).
  • with Robert Aumann & Michael Maschler: Repeated Games with Incomplete Information. MIT Press, 1995

Web links

Individual evidence

  1. ^ Frederick W. Lanchester Prize. (No longer available online.) ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot /