# Biography:Richard E. Stearns

__: American computer scientist__

**Short description**Richard Edwin Stearns | |
---|---|

Richard Stearns in 2009 | |

Born | Caldwell, New Jersey | July 5, 1936

Alma mater | Carleton College (B.A.) Princeton University (Ph.D.) |

Awards | ACM Turing Award (1993) Frederick W. Lanchester Prize (1995) |

Scientific career | |

Institutions | University at Albany |

Doctoral advisor | Harold W. Kuhn |

Doctoral students | Madhav V. Marathe (joint with Professor Harry B. Hunt III), Tom O'Connell |

**Richard Edwin Stearns** (born July 5, 1936) is a prominent 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".^{[1]} 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.^{[2]} 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.^{[3]} Stearns is now Distinguished Professor Emeritus of Computer Science at the University at Albany, which is part of the State University of New York.

## Bibliography

- Stearns, R.E.; Hartmanis, J. (March 1963), "Regularity preserving modifications of regular expressions",
*Information and Control***6**(1): 55–69, doi:10.1016/S0019-9958(63)90110-4. A first systematic study of language operations that preserve regular languages. - "On the computational complexity of algorithms",
*Transactions of the American Mathematical Society*(American Mathematical Society)**117**: 285–306, May 1965, doi:10.2307/1994208. Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory. - Stearns, R.E. (September 1967), "A Regularity Test for Pushdown Machines",
*Information and Control***11**(3): 323–340, doi:10.1016/S0019-9958(67)90591-8. Answers a basic question about deterministic pushdown automata: it is decidable whether a given deterministic pushdown automaton accepts a regular language. - Lewis II, P.M.; Stearns, R.E. (1968), "Syntax-Directed Transduction",
*Journal of the ACM***15**(3): 465–488, doi:10.1145/321466.321477. Introduces LL parsers, which play an important role in compiler design.

## References

- ↑ Lewis, Philip M.. "Richard ("Dick") Edwin Stearns". Association for Computing Machinery. https://amturing.acm.org/award_winners/stearns_1081900.cfm. Retrieved 10 March 2019.
- ↑ "Richard E Stearns - A.M. Turing Award Laureate". https://amturing.acm.org/award_winners/stearns_1081900.cfm.
- ↑ Stearns, Richard Edwin (1961) (in English).
*Three person cooperative games without side payments*. https://catalog.princeton.edu/catalog/2969972.

## External links

- {{DBLP}} template missing ID and not present in Wikidata.
- Richard Edward Stearns at the Mathematics Genealogy Project

Original source: https://en.wikipedia.org/wiki/Richard E. Stearns.
Read more |