Short permutation strings. - Leonard M. Adleman (Discret. Math., 1974)

Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) - Leonard M. Adleman; Kenneth L. Manders (FOCS, 1975)

Diophantine Complexity - Leonard M. Adleman; Kenneth L. Manders (FOCS, 1976)

NP-Complete Decision Problems for Quadratic Polynomials - Kenneth L. Manders; Leonard M. Adleman (STOC, 1976)

On Taking Roots in Finite Fields - Leonard M. Adleman; Kenneth L. Manders; Gary L. Miller (FOCS, 1977)

Reducibility, Randomness, and Intractability (Abstract) - Leonard M. Adleman; Kenneth L. Manders (STOC, 1977)

Two Theorems on Random Polynomial Time - Leonard M. Adleman (FOCS, 1978)

Improved Time and Space Bounds for Boolean Matrix Multiplication. - Leonard M. Adleman; Kellogg S. Booth; Franco P. Preparata; Walter L. Ruzzo (Acta Informatica, 1978)

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. - Ronald L. Rivest; Adi Shamir; Leonard M. Adleman (Commun. ACM, 1978)

NP-Complete Decision Problems for Binary Quadratics. - Kenneth L. Manders; Leonard M. Adleman (J. Comput. Syst. Sci., 1978)

A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) - Leonard M. Adleman (FOCS, 1979)

Reductions that Lie - Leonard M. Adleman; Kenneth L. Manders (FOCS, 1979)

On Distinguishing Prime Numbers from Composite Numbers (Abstract) - Leonard M. Adleman (FOCS, 1980)

Primality Testing. - Leonard M. Adleman (CRYPTO, 1981)

Irreducibility Testing and Factorization of Polynomials (Extended Abstract) - Leonard M. Adleman; Andrew M. Odlyzko (FOCS, 1981)

Space-Bounded Simulation of Multitape Turing Machines. - Leonard M. Adleman; Michael C. Loui (Math. Syst. Theory, 1981)

Implementing an Electronic Notary Public. - Leonard M. Adleman (CRYPTO, 1982)

On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. - Leonard M. Adleman (CRYPTO, 1982)

An Application of Higher Reciprocity to Computational Number Theory (Abstract) - Leonard M. Adleman; Robert McDonnell (FOCS, 1982)

On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) - Leonard M. Adleman (STOC, 1983)

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). - Ronald L. Rivest; Adi Shamir; Leonard M. Adleman (Commun. ACM, 1983)

Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. - Dennis Estes; Leonard M. Adleman; Kireeti Kompella; Kevin S. McCurley; Gary L. Miller (CRYPTO, 1985)

Finding Irreducible Polynomials over Finite Fields - Leonard M. Adleman; Hendrik W. Lenstra Jr. (STOC, 1986)

Recognizing Primes in Random Polynomial Time - Leonard M. Adleman; Ming-Deh A. Huang (STOC, 1987)

An Abstract Theory of Computer Viruses. - Leonard M. Adleman (CRYPTO, 1988)

Using Smoothness to Achieve Parallelism (Abstract) - Leonard M. Adleman; Kireeti Kompella (STOC, 1988)

Fast Checkers for Cryptography. - Kireeti Kompella; Leonard M. Adleman (CRYPTO, 1990)

Factoring Numbers Using Singular Integers - Leonard M. Adleman (STOC, 1991)

Inductive Inference and Unsolvability. - Leonard M. Adleman; Manuel Blum 001 (J. Symb. Log., 1991)

A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. - Leonard M. Adleman; Jonathan DeMarrais (CRYPTO, 1993)

The function field sieve. - Leonard M. Adleman (ANTS, 1994)

A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (ANTS, 1994)

Efficient checking of computations in number theory. - Leonard M. Adleman; Ming-Deh A. Huang; Kireeti Kompella (ANTS, 1994)

Open problems in number theoretic complexity, II. - Leonard M. Adleman; Kevin S. McCurley (ANTS, 1994)

Algorithmic Number Theory-The Complexity Contribution - Leonard M. Adleman (FOCS, 1994)

Algorithmic Number Theory and Its Relationship to Computational Complexity. - Leonard M. Adleman (Computer Science Today, 1995)

On constructing a molecular computer. - Leonard M. Adleman (DNA Based Computers, 1995)

Efficient Checkers for Number-Theoretic Computations - Leonard M. Adleman; Ming-Deh A. Huang; Kireeti Kompella (Inf. Comput., 1995)

Counting Rational Points on Curves and Abelian Varieties over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (ANTS, 1996)

Quantum Computability. - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (SIAM J. Comput., 1997)

A Sticker-Based Model for DNA Computation. - Sam T. Roweis; Erik Winfree; Richard Burgoyne; Nickolas V. Chelyapov; Myron F. Goodman; Paul W. K. Rothemund; Leonard M. Adleman (J. Comput. Biol., 1998)

Function Field Sieve Method for Discrete Logarithms over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (Inf. Comput., 1999)

On Applying Molecular Computation to the Data Encryption Standard. - Leonard M. Adleman; Paul W. K. Rothemund; Sam T. Roweis; Erik Winfree (J. Comput. Biol., 1999)

A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (Theor. Comput. Sci., 1999)

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 (DNA Computing, 2000)

Running time and program size for self-assembled squares. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang (STOC, 2001)

Counting Points on Curves and Abelian Varieties Over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (J. Symb. Comput., 2001)

On the Decidability of Self-Assembly of Infinite Ribbons. - Leonard M. Adleman; Jarkko Kari; Lila Kari; Dustin Reishus (FOCS, 2002)

Combinatorial optimization problems in self-assembly. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang; David Kempe 001; Pablo Moisset de Espanés; Paul W. K. Rothemund (STOC, 2002)

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. - Leonard M. Adleman; Jarkko Kari; Lila Kari; Dustin Reishus; Petr Sosík (SIAM J. Comput., 2009)

An Algorithmic View of the Universe. - Christos H. Papadimitriou; Leonard M. Adleman; Richard M. Karp; Donald E. Knuth; Robert E. Tarjan; Leslie G. Valiant (ACM-TURING, 2012)

Darwin Turing Dawkins: Building a General Theory of Evolution. - Leonard M. Adleman (CoRR, 2024)