What can be computed locally?
- Moni Naor
- Larry Stockmeyer
- 1993
- STOC 1993
Publications
Date
Featured collections
Popular topics
52 results for Larry Stockmeyer
On monadic NP vs. monadic co-NP
- Ronald Fagin
- Larry Stockmeyer
- et al.
- 1993
- SCT 1993
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- Noga Alon
- Gil Kalai
- et al.
- 1992
- FOCS 1992
Bounds on the time to reach agreement in the presence of timing uncertainty
- Hagit Attiyat
- Cynthia Dworkl
- et al.
- 1991
- STOC 1991
On the power of 2-way probabilistic finite state automata
- Cynthia Dwork
- Larry Stockmeyer
- 1989
- FOCS 1989
FLIPPING PERSUASIVELY IN CONSTANT EXPECTED TIME.
- Cynthia Dwork
- David Shmoys
- et al.
- 1985
- FOCS 1985
Alternating pushdown automata
- Richard E. Ladner
- Richard J. Lipton
- et al.
- 1978
- FOCS 1978
Alternation
- Ashok K. Chandra
- Larry J. Stockmeyer
- 1976
- FOCS 1976
Evaluation of polynomials with super-preconditioning
- Richard J. Lipton
- Larry J. Stockmeyer
- 1976
- STOC 1976
Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs
- L.T. Kou
- Larry Stockmeyer
- et al.
- 1978
- CACM