Biography:Larry Stockmeyer
From HandWiki
Short description: American computer scientist
Larry Stockmeyer | |
|---|---|
| Born | 1948 |
| Died | 31 July 2004 |
| Nationality | American |
| Occupation | computer scientist |
| Known for | Pioneers in the field of computational complexity theory |
Larry Joseph Stockmeyer (1948 – 31 July 2004) was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.[1]
Career
- 1972: BSc in mathematics, Massachusetts Institute of Technology.
- 1972: MSc in electrical engineering, Massachusetts Institute of Technology.
- 1974: PhD in computer science, Massachusetts Institute of Technology.
- Supervisor: Albert R. Meyer.
- 1974–1982: IBM Research, Thomas J. Watson Research Center, Yorktown Heights, NY.
- 1982–November 2003: IBM Research, Almaden Research Center, San Jose, CA.
- October 2002–2004: University of California, Santa Cruz, Computer Science Department – Research Associate.
Recognition
- 1996: Fellow of the Association for Computing Machinery: "For several fundamental contributions to computational complexity theory, which have significantly affected the course of this field."[2]
- 2007: The Edsger W. Dijkstra Prize in Distributed Computing for the paper (Dwork Lynch).[3][4]
Notable publications
- (Meyer Stockmeyer) — this work introduced the polynomial hierarchy.[5][6]
- (Stockmeyer 1974) — "one of the most remarkable doctoral theses in computer science".[7]
- (Chandra Stockmeyer) — this work introduced alternating Turing machines.[8]
- (Dwork Lynch) — this paper received the Dijkstra Prize in 2007.[3]
Notes
- ↑ "In Memoriam". UC Santa Cruz. 9 August 2004. http://currents.ucsc.edu/04-05/08-09/inmemoriam.html.
- ↑ ACM: Fellows Award / Larry Stockmeyer .
- ↑ 3.0 3.1 PODC web site: Dijkstra Prize 2007.
- ↑ (Bortnikov 2007).
- ↑ (Fortnow 2005).
- ↑ (Rajsbaum 2004).
- ↑ STOC 2005 program.
- ↑ Chandra & Stockmeyer (1976).
References
- Bortnikov, Edward (2007), "Review of DISC '07", ACM SIGACT News 38 (4): 49–53, doi:10.1145/1345189.1386170, ISSN 0163-5700.
- Chandra, Ashok K.; Stockmeyer, Larry J. (1976). "17th Annual Symposium on Foundations of Computer Science (SFCS 1976)". Houston, Texas. pp. 98–108. doi:10.1109/SFCS.1976.4.
- "Consensus in the presence of partial synchrony", Journal of the ACM 35 (2): 288–323, 1988, doi:10.1145/42282.42283.
- "Beyond NP: the work and legacy of Larry Stockmeyer", Proc. 37th Annual ACM Symposium on Theory of Computing (STOC, Baltimore, MD, USA, 2005), 2005, pp. 120–127, doi:10.1145/1060590.1060609, ISBN 978-1-58113-960-0, http://www.cs.uchicago.edu/~fortnow/papers/beyondnp.pdf.
- "The equivalence problem for regular expressions with squaring requires exponential space", Proc. 13th Annual Symposium on Switching and Automata Theory, 1972, pp. 125–129, doi:10.1109/SWAT.1972.29.
- Rajsbaum, Sergio (2004), "Larry Stockmeyer: 1948–2004", ACM SIGACT News 35 (4): 39, doi:10.1145/1054916.1054930, ISSN 0163-5700.
- Stockmeyer, Larry J. (1974), The Complexity of Decision Problems in Automata Theory and Logic, Massachusetts Institute of Technology. PhD Thesis.
- {{cite web
| url=http://hcr3.isiknowledge.com/author.cgi?id=1516 | title=Larry Stockmeyer | work=ISI Web of Knowledge, highly cited researchers
- "In Memoriam – Larry Stockmeyer". UC Santa Cruz Currents Online. 9 August 2004. http://currents.ucsc.edu/04-05/08-09/inmemoriam.html.
- "Administrative Message: Passing of Larry Stockmeyer". UC Santa Cruz. 5 August 2004. http://www.ucsc.edu/news_events/messages/04-05/08-05.stockmeyer.asp.
- "Larry Joseph Stockmeyer". Mathematics Genealogy Project. http://genealogy.math.ndsu.nodak.edu/id.php?id=81230.
- "STOC 2005 conference program". http://www.cs.jhu.edu/~stoc05/STOC-Program.pdf. Includes the program of 'Larry Stockmeyer Commemoration' (21 May 2005).
External links
- Larry Stockmeyer's Home Page.
- {{DBLP}} template missing ID and not present in Wikidata.
 |  |
