SUPPORT THE WORK

GetWiki

Richard E. Stearns

ARTICLE SUBJECTS
aesthetics  →
being  →
complexity  →
database  →
enterprise  →
ethics  →
fiction  →
history  →
internet  →
knowledge  →
language  →
licensing  →
linux  →
logic  →
method  →
news  →
perception  →
philosophy  →
policy  →
purpose  →
religion  →
science  →
sociology  →
software  →
truth  →
unix  →
wiki  →
ARTICLE TYPES
essay  →
feed  →
help  →
system  →
wiki  →
ARTICLE ORIGINS
critical  →
discussion  →
forked  →
imported  →
original  →
Richard E. Stearns
[ temporary import ]
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki








factoids
|birth_place = Caldwell, New Jersey|residence = |citizenship =|nationality = |fields = University at Albany, The State University of New York>University at Albany|alma_mater = Princeton University|doctoral_advisor = Harold W. Kuhn|academic_advisors =|doctoral_students = Madhav V. Marathe (joint with Professor Harry B. Hunt III), Tom O'Connell|notable_students =|known_for = |author_abbrev_bot =|author_abbrev_zoo =|influences =|influenced =Association for Computing Machinery>ACM Turing Award (1993)Frederick W. Lanchester Prize (1995)|signature = |footnotes =}}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".WEB, Lewis, Philip M., Richard ("Dick") Edwin Stearns,weblink AMTuring.ACM.org, Association for Computing Machinery, 10 March 2019, In 1994 he was inducted as a Fellow of the Association for Computing Machinery.Stearns earned his PhD from Princeton University in 1961. His PhD thesis adviser was Harold W. Kuhn. 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

  • {{citation |first1=R.E. |last1=Stearns |first2=J. |last2=Hartmanis |title=Regularity preserving modifications of regular expressions |journal=Information and Control |volume=6 |issue=1 |pages=55–69 |date=March 1963 |doi=10.1016/S0019-9958(63)90110-4 }}. A first systematic study of language operations that preserve regular languages.
  • {{citation


| last1 = Hartmanis | first1 = J. | author1-link = Juris Hartmanis
| last2 = Stearns | first2 = R. E.
| mr = 0170805
| journal = Transactions of the American Mathematical Society
| pages = 285–306
| title = On the computational complexity of algorithms
| volume = 117
| date = May 1965
| publisher = American Mathematical Society
| jstor = 1994208 | doi=10.2307/1994208}}. Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory.
  • {{citation |first=R.E. |last=Stearns |title=A Regularity Test for Pushdown Machines |journal=Information and Control |volume=11 |issue=3 |pages=323–340 |date=September 1967 |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.
  • {{citation |first1=P.M. |last1=Lewis II |first2=R.E. |last2=Stearns |title=Syntax-Directed Transduction |journal=Journal of the ACM |volume=15 |issue=3 |pages=465–488 |year=1968 |doi=10.1145/321466.321477 }}. Introduces LL parsers, which play an important role in compiler design.

References

{{reflist}}

External links

  • {{Official website}}
  • {{DBLP |name=Richard Edwin Stearns}}
  • {{MathGenealogy |name=Richard Edward Stearns}}
{{Turing award}}{{Authority control}}{{compu-scientist-stub}}

- content above as imported from Wikipedia
- "Richard E. Stearns" does not exist on GetWiki (yet)
- time: 6:55am EST - Thu, Nov 14 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
CONNECT