C. Dwork and L. Stockmeyer, A time complexity gap for two-way probabilistic finite-state automata, SIAM J. Computing 19 (1990), 1011-1023. [abstract] [copyright]
L. Stockmeyer, On approximation algorithms for #P, SIAM J. Computing 14 (1985), 849-861.
A. K. Chandra, L. Stockmeyer, and U. Vishkin, Constant depth reducibility, SIAM J. Computing 13 (1984), 423-439.
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981), 114-133.
L. J. Stockmeyer and A. K. Chandra, Provably difficult combinatorial games, SIAM J. Computing 8 (1979), 151-174.
L. J. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science 3 (1977), 1-22.
V. R. Pratt and L. J. Stockmeyer, A characterization of the power of vector machines, J. Comput. System Sci. 12 (1976), 198-221.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science 1 (1976), 237-267.
M. S. Paterson and L. J. Stockmeyer, On the number of nonscalar multiplications necessary to evaluate polynomials, SIAM J. Computing 2 (1973), 60-66.
A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space (PDF), Conf. Rec. 13th IEEE Symp. on Switching and Automata Theory, Oct. 1972, 125-129.
C. Dwork and L. Stockmeyer, Finite state verifiers II: Zero knowledge, (figures (PDF)), J. Assoc. Comput. Mach. 39 (1992), 829-858. [abstract] [copyright]
N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, Theoretical Computer Science 130 (1994), 175-201. [abstract]
H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer, Bounds on the time to reach agreement in the presence of timing uncertainty, J. Assoc. Comput. Mach. 41 (1994), 122-152. [abstract] [copyright]
C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, J. Assoc. Comput. Mach. 35 (1988), 288-323. [abstract]
D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchronism needed for distributed consensus, J. Assoc. Comput. Mach. 34 (1987), 77-97. [abstract]