- Computational Complexity
- Interactive Proof Systems
- Parallel and Distributed Computing
- Storage Systems
- Other

[ps] [abstract]

On monadic NP vs. monadic co-NP,
R. Fagin, L. J. Stockmeyer, and M. Y. Vardi,
*Information and Computation* 120 (1995), pp. 78-92.

[pdf]
[abstract]

The complexity of word problems – this time with interleaving,
A. J. Mayer and L. J. Stockmeyer,
*Information and Computation* 115 (1994), pp. 293-311.

[ps]
[abstract]

A time complexity gap for two-way probabilistic finite-state automata,
C. Dwork and L. Stockmeyer,
*SIAM J. Computing* 19 (1990), pp. 1011-1023.

[ps]
[abstract]

Parallel algorithms for term matching,
C Dwork, P. C. Kanellakis, and L. Stockmeyer,
*SIAM J. Computing* 17 (1988), pp. 711-731.

[pdf]
[abstract]

On approximation algorithms for #P,
L. Stockmeyer,
*SIAM J. Computing* 14 (1985), pp. 849-861.

[pdf]
[abstract]

Constant depth reducibility,
A. K. Chandra, L. Stockmeyer, and U. Vishkin,
*SIAM J. Computing* 13 (1984), pp. 423-439.

[pdf]
[abstract]

Simulation of parallel random access machines by circuits,
L. Stockmeyer and U. Vishkin,
*SIAM J. Computing* 13 (1984), pp. 423-439.

[pdf]
[abstract]

Optimal orientations of cells in slicing floorplan designs,
L. Stockmeyer,
*Information and Control* 57 (1983), pp. 91-101.

[pdf]
[abstract]

Alternation,
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer,
*J. ACM* 28 (1981), pp. 114-133.

[pdf]

Provably difficult combinatorial games,
L. J. Stockmeyer and A. K. Chandra,
*SIAM J. Computing* 8 (1979), pp. 151-174.

[pdf]

The polynomial-time hierarchy,
L. J. Stockmeyer,
*Theoretical Computer Science* 3 (1977), pp. 1-22.

[pdf]

A characterization of the power of vector machines,
V. R. Pratt and L. J. Stockmeyer,
*J. Comput. System Sci.* 12 (1976), pp. 198-221.

[pdf]

The equivalence problem for
regular expressions with squaring requires exponential space,
A. R. Meyer and L. J. Stockmeyer,
*Conf. Rec. 13th IEEE Symp. on Switching and Automata Theory*,
Oct. 1972, pp. 125-129.

[pdf]

[ps] [abstract]

Finite state verifiers II: Zero knowledge,
C. Dwork and L. Stockmeyer,
*J. ACM* 39 (1992), pp. 829-858.

[ps, figures (pdf)]
[abstract]

[ps] [abstract]

Lower bounds on the competitive ratio for mobile
user tracking and distributed job scheduling,
N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer,
*Theoretical Computer Science* 130 (1994), pp. 175-201.

[ps]
[abstract]

Bounds on the time to reach agreement in the presence of
timing uncertainty,
H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer,
*J. ACM* 41 (1994), pp. 122-152.

[ps]
[abstract]

Consensus in the presence of partial synchrony,
C. Dwork, N. Lynch, and L. Stockmeyer,
*J. ACM* 35 (1988), pp. 288-323.

[pdf]
[abstract]

On the minimal synchronism needed for distributed consensus,
D. Dolev, C. Dwork, and L. Stockmeyer,
*J. ACM* 34 (1987), pp. 77-97.

[pdf]
[abstract]

[pdf] [ps] [abstract]

An age-threshold algorithm for garbage collection in
log-structured arrays and file systems,
J. Menon and L. Stockmeyer,
IBM Research Report RJ 10120, May 1998.
An abridged version appears in
*High Performance Computing Systems and Applications*,
J. Schaeffer, ed., Kluwer, 1998, pp. 119-132.

[pdf]
[ps]
[abstract]

Efficiently extendible mappings for balanced data distribution,
D. M. Choy, R. Fagin, and L. Stockmeyer,
*Algorithmica* 16 (1996), pp. 215-232.

[pdf]
[abstract]

[ pdf] [abstract]

Last modified: January 9, 2004