Science Atlas

How We Know What We Know
Sign In
Text size
100%
Theme
Scientist

Richard Stearns

Computer Science

Richard Edwin Stearns is an American computer scientist and Distinguished Professor Emeritus of Computer Science at the University at Albany, part of the State University of New York, who earned his PhD in mathematics from Princeton University in 1961 under Harold W. Kuhn. With Juris Hartmanis, Stearns co-authored a foundational 1965 paper that formally defined computational complexity classes and proved the time hierarchy theorem, work now recognized as having established computational complexity theory as a field of study. Stearns and Hartmanis shared the ACM Turing Award in 1993 for that seminal paper, and Stearns was inducted as a Fellow of the Association for Computing Machinery in 1994 and received the Frederick W. Lanchester Prize in 1995. His broader research contributed to the theory of regular expressions, pushdown automata and compiler design.

Facts
Birth Year
1936 1
Birth Date
1936-07-05 1
Field
Computer Science 1
Nationality
American 1
Notable Work
Foundations of computational complexity theory, with Juris Hartmanis 1
Birthplace
Caldwell, New Jersey, USA 1
In the Other Atlases
Sources
1. Richard E. Stearns, Wikipedia
  • Infobox, Born
    July 5, 1936
  • Infobox, Born, place
    Caldwell, New Jersey
  • Lead sentence
    was an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award
  • Turing Award citation
    in recognition of their seminal paper which established the foundations for the field of computational complexity theory.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.