| 2002 | FOCS | On the Decidability of Self-Assembly of Infinite Ribbons. | Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus |
| 2002 | STOC | Combinatorial optimization problems in self-assembly. | Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espans, Paul W. K. Rothemund |
| 2001 | STOC | Running time and program size for self-assembled squares. | Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang |
| 2000 | DNA | Solution of a Satisfiability Problem on a Gel-Based DNA Computer. | Ravinderjit S. Braich, Cliff Johnson, Paul W. K. Rothemund, Darryl Hwang, Nickolas V. Chelyapov, Leonard M. Adleman |
| 1994 | FOCS | Algorithmic Number Theory-The Complexity Contribution | Leonard M. Adleman |
| 1993 | CRYPTO | A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. | Leonard M. Adleman, Jonathan DeMarrais |
| 1991 | STOC | Factoring Numbers Using Singular Integers | Leonard M. Adleman |
| 1990 | CRYPTO | Fast Checkers for Cryptography. | Kireeti Kompella, Leonard M. Adleman |
| 1988 | CRYPTO | An Abstract Theory of Computer Viruses. | Leonard M. Adleman |
| 1988 | STOC | Using Smoothness to Achieve Parallelism (Abstract) | Leonard M. Adleman, Kireeti Kompella |
| 1987 | STOC | Recognizing Primes in Random Polynomial Time | Leonard M. Adleman, Ming-Deh A. Huang |
| 1986 | STOC | Finding Irreducible Polynomials over Finite Fields | Leonard M. Adleman, Hendrik W. Lenstra Jr. |
| 1985 | CRYPTO | Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. | Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller |
| 1983 | STOC | On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) | Leonard M. Adleman |
| 1982 | CRYPTO | Implementing an Electronic Notary Public. | Leonard M. Adleman |
| 1982 | CRYPTO | On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. | Leonard M. Adleman |
| 1982 | FOCS | An Application of Higher Reciprocity to Computational Number Theory (Abstract) | Leonard M. Adleman, Robert McDonnell |
| 1981 | CRYPTO | Primality Testing. | Leonard M. Adleman |
| 1981 | FOCS | Irreducibility Testing and Factorization of Polynomials (Extended Abstract) | Leonard M. Adleman, Andrew M. Odlyzko |
| 1980 | FOCS | On Distinguishing Prime Numbers from Composite Numbers (Abstract) | Leonard M. Adleman |
| 1979 | FOCS | A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) | Leonard M. Adleman |
| 1979 | FOCS | Reductions that Lie | Leonard M. Adleman, Kenneth L. Manders |
| 1978 | FOCS | Two Theorems on Random Polynomial Time | Leonard M. Adleman |
| 1977 | FOCS | On Taking Roots in Finite Fields | Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller |
| 1977 | STOC | Reducibility, Randomness, and Intractability (Abstract) | Leonard M. Adleman, Kenneth L. Manders |
| 1976 | FOCS | Diophantine Complexity | Leonard M. Adleman, Kenneth L. Manders |
| 1976 | STOC | NP-Complete Decision Problems for Quadratic Polynomials | Kenneth L. Manders, Leonard M. Adleman |
| 1975 | FOCS | Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) | Leonard M. Adleman, Kenneth L. Manders |