Publications

This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.

Date

Start

End

Featured collections

Popular topics

52 results for Larry Stockmeyer

Closure of monadic NP
- - Miklos Ajtai
  - Ronald Fagin
  - et al.
- 2000
- Journal of Computer and System Sciences
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)
Time complexity gap for two-way probabilistic finite-state automata
- - Cynthia Dwork
  - Larry Stockmeyer
- 1990
- SIAM Journal on Computing
Flipping persuasively in constant time
- - Cynthia Dwork
  - David Shmoys
  - et al.
- 1990
- SIAM Journal on Computing
Parallel algorithms for term matching
- - Cynthia Dwork
  - Paris C. Kanellakis
  - et al.
- 1988
- SIAM Journal on Computing