Larry Stockmeyer

• 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.

• 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."[http://fellows.acm.org/fellow_citation.cfm?id=1438050&srt=all ACM: Fellows Award / Larry Stockmeyer] {{webarchive|url=https://web.archive.org/web/20071214193649/http://fellows.acm.org/fellow_citation.cfm?id=1438050&srt=all |date=2007-12-14 }}.
• 2007: The Edsger W. Dijkstra Prize in Distributed Computing for the paper {{harvtxt|Dwork|Lynch|Stockmeyer|1988}}.PODC web site: [http://www.podc.org/podc2007/dijkstra.shtml Dijkstra Prize 2007].{{harvtxt|Bortnikov|2007}}.

• {{harvtxt|Meyer|Stockmeyer|1972}} — this work introduced the polynomial hierarchy.{{harvtxt|Fortnow|2005}}.{{harvtxt|Rajsbaum|2004}}.
• {{harvtxt|Stockmeyer|1974}} — "one of the most remarkable doctoral theses in computer science".[http://www.cs.jhu.edu/~stoc05/STOC-Program.pdf STOC 2005 program].
• {{harvtxt|Chandra|Stockmeyer|1976}} — this work introduced alternating Turing machines.{{sfnp|Chandra|Stockmeyer|1976}}
• {{harvtxt|Dwork|Lynch|Stockmeyer|1988}} — this paper received the Dijkstra Prize in 2007.

{{Incomplete list|date=September 2009}}

{{reflist}}

• {{citation

| last=Bortnikov | first=Edward

| title=Review of DISC '07

| journal=ACM SIGACT News

| volume=38

| issue=4

| year=2007

| pages=49–53

| issn=0163-5700

| doi=10.1145/1345189.1386170

| doi-access=free

}}.

• {{Cite conference

|doi=10.1109/SFCS.1976.4

|last1=Chandra

|first1=Ashok K.

|last2=Stockmeyer

|first2=Larry J.

|title=17th Annual Symposium on Foundations of Computer Science (SFCS 1976)

|chapter=Alternation

|book-title=Proc. 17th IEEE Symp. on Foundations of Computer Science|

location=Houston, Texas

|year=1976

|pages=98–108

}}

• {{citation

| title=Consensus in the presence of partial synchrony

| last1=Dwork | first1=Cynthia | author-link1=Cynthia Dwork

| last2=Lynch | first2=Nancy | author-link2=Nancy Lynch

| last3=Stockmeyer | first3=Larry

| journal=Journal of the ACM

| volume=35

| issue=2

| year=1988

| pages=288–323

| doi=10.1145/42282.42283

| citeseerx=10.1.1.13.3423 | s2cid=17007235 }}.

• {{citation

| last=Fortnow | first=Lance | author-link=Lance Fortnow

| chapter=Beyond NP: the work and legacy of Larry Stockmeyer

| title=Proc. 37th Annual ACM Symposium on Theory of Computing (STOC, Baltimore, MD, USA, 2005)

| pages=120–127

| year=2005

| isbn=978-1-58113-960-0

| doi=10.1145/1060590.1060609

| chapter-url=http://www.cs.uchicago.edu/~fortnow/papers/beyondnp.pdf

| title-link=Symposium on Theory of Computing | s2cid=16558679 }}.

• {{citation

| chapter=The equivalence problem for regular expressions with squaring requires exponential space

| last1=Meyer | first1=Albert R. | author-link=Albert R. Meyer

| last2=Stockmeyer | first2=Larry J.

| title=Proc. 13th Annual Symposium on Switching and Automata Theory

| pages=125–129

| year=1972

| doi=10.1109/SWAT.1972.29

| title-link=Symposium on Switching and Automata Theory }}.

• {{citation

| last=Rajsbaum | first=Sergio

| title=Larry Stockmeyer: 1948–2004

| journal=ACM SIGACT News

| volume=35

| issue=4

| year=2004

| page=39

| issn=0163-5700

| doi=10.1145/1054916.1054930

| s2cid=26255529

}}.

• {{citation

| last=Stockmeyer | first=Larry J.

| title=The Complexity of Decision Problems in Automata Theory and Logic

| year=1974

| hdl=1721.1/15540

| publisher=Massachusetts Institute of Technology

| type=Thesis

}}. PhD Thesis.

• {{cite web

| url=http://hcr3.isiknowledge.com/author.cgi?id=1516

| title=Larry Stockmeyer

| work=ISI Web of Knowledge, highly cited researchers

}}{{dead link|date=April 2016}}

• {{cite web

| url=http://currents.ucsc.edu/04-05/08-09/inmemoriam.html

| title=In Memoriam – Larry Stockmeyer

| work=UC Santa Cruz Currents Online

| date=9 August 2004

}}

• {{cite web

|url = http://www.ucsc.edu/news_events/messages/04-05/08-05.stockmeyer.asp

|title = Administrative Message: Passing of Larry Stockmeyer

|work = UC Santa Cruz

|date = 5 August 2004

|access-date = 2009-02-08

|archive-url = https://web.archive.org/web/20080528211529/http://www.ucsc.edu/news_events/messages/04-05/08-05.stockmeyer.asp

|archive-date = 2008-05-28

|url-status = dead

}}

• {{cite web

| url=http://genealogy.math.ndsu.nodak.edu/id.php?id=81230

| title=Larry Joseph Stockmeyer

| work=Mathematics Genealogy Project

}}

• {{cite web

| url=http://www.cs.jhu.edu/~stoc05/STOC-Program.pdf

| title=STOC 2005 conference program

}} Includes the program of 'Larry Stockmeyer Commemoration' (21 May 2005).

• [https://web.archive.org/web/20040814025958/http://www.geocities.com/stockmeyer@sbcglobal.net/ Larry Stockmeyer's Home Page].
• {{DBLP|name=Larry J. Stockmeyer}}

{{Authority control}}

{{DEFAULTSORT:Stockmeyer, Larry}}

Category:1948 births

Category:2004 deaths

Category:American theoretical computer scientists

Category:Researchers in distributed computing

Category:MIT School of Engineering alumni

Category:University of California, Santa Cruz faculty

Category:1996 fellows of the Association for Computing Machinery

Category:Dijkstra Prize laureates

Category:Massachusetts Institute of Technology School of Science alumni

{{compu-scientist-stub}}