“Richard E. Stearns”的意思、由来-开放百科全书

词条

Richard E. Stearns

释义

Bibliography
References
External links

{{Infobox scientist
|name = Richard Edwin Stearns
|image = Dick Stearns.jpg
|image_size =
|caption = Richard Stearns in 2009
|birth_date = {{birth date and age|1936|7|5}}
|birth_place = Caldwell, New Jersey
|residence =
|citizenship =
|nationality =
|fields =
|workplaces = 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 =
|awards = 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".^[1] 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 |url=http://www.sciencedirect.com/science/article/pii/S0019995863901104}}. 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 |url=http://www.sciencedirect.com/science/article/pii/S0019995867905918}}. 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 |url=http://dl.acm.org/citation.cfm?id=321477&CFID=180941016&CFTOKEN=25034214}}. Introduces LL parsers, which play an important role in compiler design.

References

1. ^{{cite web |last1=Lewis |first1=Philip M. |title=Richard ("Dick") Edwin Stearns |url=https://amturing.acm.org/award_winners/stearns_1081900.cfm |website=AMTuring.ACM.org |publisher=Association for Computing Machinery |accessdate=10 March 2019}}

External links

{{Official website}}
{{DBLP |name=Richard Edwin Stearns}}
{{MathGenealogy |name=Richard Edward Stearns}}

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。