Larry Stockmeyer

Known as: Larry J. Stockmeyer 
Larry Joseph Stockmeyer (1948 – 31 July 2004) was an American computer scientist. He was one of the pioneers in the field of computational complexity… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
In the exploration and implementation of formation control strategies, communication range and bandwidth limitations form a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2005
Review
2005
Shortly after Steve Cook and Richard Karp showed the ex-istence of many natural NP-complete languages, researchers started to… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Shimer (2005) and Hall (2005) have recently emphasized that the conventional model of unemployment dynamics due to Mortensen… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
2004
2004
Larry was born in Evansville, Indiana, in 1948. He attended college at MIT, receiving a B.S. in mathematics and an M.S. in… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Probabilistic Context-Free Grammars (PCFGs) and variations on them have recently become some of the most common formalisms for… (More)
  • figure 1.2
  • figure 3.6
  • figure 3.8
  • figure 3.15
  • figure 5.12
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Upper and lower bounds are proved for the real time complexity of the problem of reaching agreement in a distributed network, in… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
1. In t roduc t ion I{t~txml, ly there has been much interest ill tht, comput:Ltional power of circuits o1' bounded dt;pth. In… (More)
Is this relevant?
1978
1978
1.1 Summary or Results Alternating Turing machines were introduced by Chandra and Stockmeyer [2] and by Kozen [12] as an… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Turing machine space complexity is related to circuit depth complexity. The relationship complements the known connection between… (More)
  • figure 2
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The inherent computational complexity of a va r i e ty of decision problems i n mathematical logic and the theory of automata i s… (More)
  • table 4.2
Is this relevant?