Richard Stearns (computer scientist)
Richard " Dick" Edwin Stearns ( born July 5, 1936 in Caldwell, New Jersey ) is an American computer scientist who received 1993 together with Juris Hartmanis the Turing Award for his achievements in the field of complexity theory.
Stearns received his BA in mathematics in 1958 at Carleton College, in 1961 he received his doctorate in mathematics at Harold W. Kuhn at Princeton University to game theory topic Three Person Cooperative Games Without Side Payments.
Even earlier, in the summer of 1960, he had worked in the research division of General Electric in Schenectady with Juris Hartmanis. This work he continued in June 1961. In 1964, he and Hartmanis published the for complexity theory pioneering and eponymous Paper Computational complexity of recursive sequences (1965 re-released On the computational complexity of algorithms ), in which they DTIME and thus generally introduced complexity classes and an early speedup theorem among others. Together with Phil Lewis led Stearns and Hartmanis 1965 in addition to the time and the space complexity. Only after this work Stearns was first introduced to computers in touch.
From September 1978 Stearns was at the University at Albany, where to August 1989, he headed the Department of computer science, from January 1982. In 1994 he was honored as a " Distinguished Professor ", since September 2000, he is professor emeritus.
In 1975 he was a visiting professor at the Hebrew University of Jerusalem, 1977-1978 adjunct professor at Rensselaer Polytechnic Institute, and in 1985 a visiting scientist at the Mathematical Sciences Research Institute at the University of California, Berkeley.
Stearns is married and has two children.
He was a founding member of the Game Theory Society and is a Fellow of the ACM. With his mentor at Princeton, Robert Aumann, Michael Maschler, and he won the 1995 Frederick W. Lanchester Prize -.
Writings
- With Juris Hartmanis: On the computational complexity of algorithms. Transactions of the American Mathematical Society 117 (1965), pp. 285-306. First as 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 and Phil M. Lewis: Hierarchies of Memory Limited Computations (PDF, 398 kB). In: Proceedings of the Sixth Annual IEEE Symposium on Switching Circuit Theory and Logical Design, Ann Arbor, Mich., 1965, pp. 179-190. .
- With Frederick C. Hennie: Two -tape simulation of multi -tape Turing machines. Journal of the ACM, 13, 10 ( October 1966 ), pp. 533-546.
- With Robert Aumann and Michael Maschler: Repeated Games with Incomplete Information. MIT Press 1995