| 2006 | LATIN | An Architecture for Provably Secure Computation. | Mikls Ajtai, Cynthia Dwork, Larry J. Stockmeyer |
| 2002 | STOC | 2-round zero knowledge and proof auditors. | Cynthia Dwork, Larry J. Stockmeyer |
| 1999 | FOCS | Magic Functions. | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
| 1998 | ISCA | Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism. | Guillermo A. Alvarez, Walter A. Burkhard, Larry J. Stockmeyer, Flaviu Cristian |
| 1998 | STOC | The Closure of Monadic NP (Extended Abstract). | Mikls Ajtai, Ronald Fagin, Larry J. Stockmeyer |
| 1993 | STOC | What can be computed locally? | Moni Naor, Larry J. Stockmeyer |
| 1992 | FOCS | Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) | Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer |
| 1991 | STOC | Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty | Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer |
| 1989 | FOCS | On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract) | Cynthia Dwork, Larry J. Stockmeyer |
| 1988 | CRYPTO | Zero-Knowledge With Finite State Verifiers. | Cynthia Dwork, Larry J. Stockmeyer |
| 1986 | CADE | Parallel Algorithms for Term Matching. | Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer |
| 1986 | FOCS | Flipping Persuasively in Constant Expected Time (Preliminary Version) | Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer |
| 1985 | STOC | The Complexity of Backtrack Searches (Preliminary Version) | Larry Carter, Larry J. Stockmeyer, Mark N. Wegman |
| 1985 | STOC | The Distributed Firing Squad Problem (Preliminary Version) | Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer |
| 1985 | STOC | Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report | Moshe Y. Vardi, Larry J. Stockmeyer |
| 1984 | PODC | Consensus in the Presence of Partial Synchrony (Preliminary Version). | Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer |
| 1983 | FCT | Pseudorandom Number Generation and Space Complexity. | Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer |
| 1983 | FOCS | On the Minimal Synchronism Needed for Distributed Consensus | Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer |
| 1983 | STOC | The Complexity of Approximate Counting (Preliminary Version) | Larry J. Stockmeyer |
| 1982 | FOCS | A Complexity Theory for Unbounded Fan-In Parallelism | Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin |
| 1978 | FOCS | Alternating Pushdown Automata (Preliminary Report) | Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer |
| 1976 | FOCS | Alternation | Ashok K. Chandra, Larry J. Stockmeyer |
| 1976 | STOC | Evaluation of Polynomials with Super-Preconditioning | Richard J. Lipton, Larry J. Stockmeyer |
| 1975 | STOC | Hashing Schemes for Extendible Arrays (Extended Arrays) | Arnold L. Rosenberg, Larry J. Stockmeyer |
| 1974 | STOC | Some Simplified NP-Complete Problems | M. R. Garey, David S. Johnson, Larry J. Stockmeyer |
| 1974 | STOC | A Characterization of the Power of Vector Machines | Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer |
| 1973 | STOC | Fast On-Line Integer Multiplication | Michael J. Fischer, Larry J. Stockmeyer |
| 1973 | STOC | Word Problems Requiring Exponential Time: Preliminary Report | Larry J. Stockmeyer, Albert R. Meyer |
| 1972 | FOCS | The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space | Albert R. Meyer, Larry J. Stockmeyer |
| 1971 | FOCS | Bounds on the Evaluation Time for Rational Polynomials | Mike Paterson, Larry J. Stockmeyer |