Richard E. Stearns
Template:Short description Template:Infobox scientist Richard Edwin Stearns (born July 5, 1936) is an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".<ref name="TuringAward">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> In 1994 he was inducted as a Fellow of the Association for Computing Machinery.
Stearns graduated with a B.A. in mathematics from Carleton College in 1958.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> He then received his Ph.D. in mathematics from Princeton University in 1961 after completing a doctoral dissertation, titled Three person cooperative games without side payments, under the supervision of Harold W. Kuhn.<ref>Template:Cite book</ref> Stearns is now Distinguished Professor Emeritus of Computer Science at the University at Albany, which is part of the State University of New York.<ref name="IEEE Xplore Richard E. Stearns">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
BibliographyEdit
- Template:Citation. A first systematic study of language operations that preserve regular languages.
- Template:Citation. Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory.
- Template:Citation. Answers a basic question about deterministic pushdown automata: it is decidable whether a given deterministic pushdown automaton accepts a regular language.
- Template:Citation. Introduces LL parsers, which play an important role in compiler design.