Publications

52 results for Larry Stockmeyer

Closure of monadic NP
- - Miklos Ajtai
  - Ronald Fagin
  - et al.
- 1998
- STOC 1998
Relaxing the Triangle Inequality in Pattern Matching
- - Ronald Fagin
  - Larry Stockmeyer
- 1998
- IJCV
The complexity of PDL with interleaving
- - Alain J. Mayer
  - Larry J. Stockmeyer
- 1996
- Theoretical Computer Science
Efficiently Extendible Mappings for Balanced Data Distribution
- - D.M. Choy
  - Ronald Fagin
  - et al.
- 1996
- Algorithmica (New York)
On monadic NP vs monadic co-NP
- - Ronald Fagin
  - Larry J. Stockmeyer
  - et al.
- 1995
- Information and Computation
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- - Noga Alon
  - Gil Kalai
  - et al.
- 1994
- Theoretical Computer Science
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
- - Hagit Attiya
  - Cynthia Dwork
  - et al.
- 1994
- Journal of the ACM (JACM)
What can be computed locally?
- - Moni Naor
  - Larry Stockmeyer
- 1993
- STOC 1993
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