Internet Agealgorithmstheory of computation

Richard E. Stearns

Richard Edwin Stearns is an American computer scientist who, with Juris Hartmanis, received the 1993

1936 – presentU.S.AContribution: 1993

Introduction

Richard E. Stearns (born 1936) is an American computer scientist and recipient of the Turing Award. He has made significant contributions to the field of computational complexity theory. Stearns co-developed the theory of NP-completeness and has contributed to the understanding of the computational complexity of various problems and algorithms.

Key Achievement

Known for co-founding computational complexity theory. Along with Juris Hartmanis, he proved the Time Hierarchy Theorem, contributed to automata theory, and received the Turing Award in 1993. His work advanced our understanding of algorithmic complexity and formal languages.

Biography

Richard Edwin Stearns 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". In 1994 he was inducted as a Fellow of the Association for Computing Machinery.

Did You Know?

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.
Stearns is now Distinguished Professor Emeritus of Computer Science at the University at Albany, which is part of the State University of New York.