Starting on November 23, 2002, I'll be on a bridge-to-retirement leave of
absence from IBM.
My new email address is
stock@acm.org
and my new homepage is
pages.sbcglobal.net/stockmeyer
I am in the Computer Science Principles and Methodologies Department, part of the Computer Science Function at the IBM Almaden Research Center.
M. Ajtai, R. Fagin, and L. Stockmeyer, The closure of monadic NP, J. Comput. System Sci. 60 (2000), 660-716. [abstract] [copyright]
C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer, Magic functions, extended abstract appears in Proc. 40th IEEE Symp. on Foundations of Computer Science, Oct. 1999, 523-534. [abstract]
M. Ajtai, R. C. Burns, R. Fagin, D. D. E. Long, and L. Stockmeyer, Compactly encoding unstructured inputs with differential compression, IBM Research Report RJ10187, April 2000 (revised Aug. 2001), to appear in J. Assoc. Comput. Mach. [abstract]
L. Stockmeyer, Simulations of the age-threshold and fitness free space collection algorithms on a long trace, IBM Research Report RJ10222, Oct. 2001. [abstract]
G. A. Alvarez, W. A. Burkhard, L. Stockmeyer, and F. Cristian, Declustered disk array architectures with optimal and near-optimal parallelism, Proc. 25th Intl. Symp. on Computer Architecture, June 1998, 109-120. [abstract] [copyright]
J. Menon and L. Stockmeyer, An age-threshold algorithm for garbage collection in log-structured arrays and file systems, IBM Research Report RJ 10120, May 1998; an abridged version appears in High Performance Computing Systems and Applications, J. Schaeffer, ed., Kluwer, 1998, 119-132. [abstract]
L. Stockmeyer, Classifying the computational complexity of problems, J. Symbolic Logic 52 (1987), 1-43. [table of contents] [copyright]
L. J. Stockmeyer and A. K. Chandra, Intrinsically difficult problems, Scientific American 240 (May, 1979), 140-159; reprinted in Trends in Computing, Scientific American Inc., 1988, 88-97.