# Larry Stockmeyer

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

- Robotics and Autonomous Systems
- 2008

In the exploration and implementation of formation control strategies, communication range and bandwidth limitations form a… (More)

Is this relevant?

Review

2005

Review

2005

- STOC
- 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

- 2005

Shimer (2005) and Hall (2005) have recently emphasized that the conventional model of unemployment dynamics due to Mortensen… (More)

Is this relevant?

2004

2004

- SIGACT News
- 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

- ArXiv
- 1998

Probabilistic Context-Free Grammars (PCFGs) and variations on them have recently become some of the most common formalisms for… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- STOC
- 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

- STOC
- 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

- 19th Annual Symposium on Foundations of Computer…
- 1978

1.1 Summary or Results Alternating Turing machines were introduced by Chandra and Stockmeyer [2] and by Kozen [12] as an… (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- SIAM J. Comput.
- 1977

Turing machine space complexity is related to circuit depth complexity. The relationship complements the known connection between… (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- 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)

Is this relevant?