Links between complexity theory and constrained block coding,
L. Stockmeyer and D. S. Modha,
IEEE Trans. on Information Theory 48, 1 (2002), pp. 59-88.
The closure of monadic NP,
M. Ajtai, R. Fagin, and L. Stockmeyer,
J. Comput. System Sci. 60 (2000), pp. 660-716.
C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer,
J. ACM 50 (2003), pp. 852-921.
Compactly encoding unstructured inputs with
M. Ajtai, R. C. Burns, R. Fagin, D. D. E. Long, and L. Stockmeyer,
J. ACM 49 (2002), pp. 318-367.
Scalable session locking for a distributed file system,
R. C. Burns, R. M. Rees, L. J. Stockmeyer, and D. D. E. Long,
Cluster Computing 4 (2001), pp. 295-306.
Simulations of the age-threshold and fitness
free space collection algorithms on a long trace,
IBM Research Report RJ10222, Oct. 2001.
Classifying the computational complexity of problems,
J. Symbolic Logic 52 (1987), pp. 1-43.
[pdf] [table of contents]
Intrinsically difficult problems, L. J. Stockmeyer and A. K. Chandra, Scientific American 240 (May, 1979), pp. 140-159; reprinted in Trends in Computing, Scientific American Inc., 1988, pp. 88-97.