Leonard M. Adleman

Publication Activity (10 Years)

Years Active: 1974-2024
Publications (10 Years): 1

Top Topics

Image Denoising

Artificial Life

Top Venues

Publications

Leonard M. Adleman
Darwin Turing Dawkins: Building a General Theory of Evolution. CoRR (2024)
Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant
An Algorithmic View of the Universe. ACM-TURING (2012)
Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. 38 (6) (2009)
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund
Combinatorial optimization problems in self-assembly. STOC (2002)
Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
On the Decidability of Self-Assembly of Infinite Ribbons. FOCS (2002)
Leonard M. Adleman, Ming-Deh A. Huang
Counting Points on Curves and Abelian Varieties Over Finite Fields. J. Symb. Comput. 32 (3) (2001)
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
Running time and program size for self-assembled squares. STOC (2001)
Ravinderjit S. Braich, Cliff Johnson, Paul W. K. Rothemund, Darryl Hwang, Nickolas V. Chelyapov, Leonard M. Adleman
Solution of a Satisfiability Problem on a Gel-Based DNA Computer. DNA Computing (2000)
Leonard M. Adleman, Ming-Deh A. Huang
Function Field Sieve Method for Discrete Logarithms over Finite Fields. Inf. Comput. 151 (1-2) (1999)
Leonard M. Adleman, Paul W. K. Rothemund, Sam T. Roweis, Erik Winfree
On Applying Molecular Computation to the Data Encryption Standard. J. Comput. Biol. 6 (1) (1999)
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). Theor. Comput. Sci. 226 (1-2) (1999)
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nickolas V. Chelyapov, Myron F. Goodman, Paul W. K. Rothemund, Leonard M. Adleman
A Sticker-Based Model for DNA Computation. J. Comput. Biol. 5 (4) (1998)
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
Quantum Computability. SIAM J. Comput. 26 (5) (1997)
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nickolas V. Chelyapov, Myron F. Goodman, Paul W. K. Rothemund, Leonard M. Adleman
A sticker based model for DNA computation. DNA Based Computers (1996)
Leonard M. Adleman, Paul W. K. Rothemund, Sam T. Roweis, Erik Winfree
On applying molecular computation to the data encryption standard. DNA Based Computers (1996)
Leonard M. Adleman, Ming-Deh A. Huang
Counting Rational Points on Curves and Abelian Varieties over Finite Fields. ANTS (1996)
Leonard M. Adleman
On constructing a molecular computer. DNA Based Computers (1995)
Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
Efficient Checkers for Number-Theoretic Computations Inf. Comput. 121 (1) (1995)
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. ANTS (1994)
Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella
Efficient checking of computations in number theory. ANTS (1994)
Leonard M. Adleman, Kevin S. McCurley
Open problems in number theoretic complexity, II. ANTS (1994)
Leonard M. Adleman
The function field sieve. ANTS (1994)
Leonard M. Adleman
Algorithmic Number Theory-The Complexity Contribution FOCS (1994)
Leonard M. Adleman, Jonathan DeMarrais
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. CRYPTO (1993)
Leonard M. Adleman, Manuel Blum
Inductive Inference and Unsolvability. J. Symb. Log. 56 (3) (1991)
Leonard M. Adleman
Factoring Numbers Using Singular Integers STOC (1991)
Kireeti Kompella, Leonard M. Adleman
Fast Checkers for Cryptography. CRYPTO (1990)
Leonard M. Adleman, Kireeti Kompella
Using Smoothness to Achieve Parallelism (Abstract) STOC (1988)
Leonard M. Adleman
An Abstract Theory of Computer Viruses. CRYPTO (1988)
Leonard M. Adleman, Ming-Deh A. Huang
Recognizing Primes in Random Polynomial Time STOC (1987)
Leonard M. Adleman, Hendrik W. Lenstra Jr.
Finding Irreducible Polynomials over Finite Fields STOC (1986)
Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. CRYPTO (1985)
Leonard M. Adleman
On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) STOC (1983)
Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). Commun. ACM 26 (1) (1983)
Leonard M. Adleman
Implementing an Electronic Notary Public. CRYPTO (1982)
Leonard M. Adleman
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. CRYPTO (1982)
Leonard M. Adleman, Robert McDonnell
An Application of Higher Reciprocity to Computational Number Theory (Abstract) FOCS (1982)
Leonard M. Adleman, Michael C. Loui
Space-Bounded Simulation of Multitape Turing Machines. Math. Syst. Theory 14 (1981)
Leonard M. Adleman, Andrew M. Odlyzko
Irreducibility Testing and Factorization of Polynomials (Extended Abstract) FOCS (1981)
Leonard M. Adleman
Primality Testing. CRYPTO (1981)
Leonard M. Adleman
On Distinguishing Prime Numbers from Composite Numbers (Abstract) FOCS (1980)
Leonard M. Adleman, Kenneth L. Manders
Reductions that Lie FOCS (1979)
Leonard M. Adleman
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) FOCS (1979)
Kenneth L. Manders, Leonard M. Adleman
NP-Complete Decision Problems for Binary Quadratics. J. Comput. Syst. Sci. 16 (2) (1978)
Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica 11 (1978)
Leonard M. Adleman
Two Theorems on Random Polynomial Time FOCS (1978)
Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21 (2) (1978)
Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller
On Taking Roots in Finite Fields FOCS (1977)
Leonard M. Adleman, Kenneth L. Manders
Reducibility, Randomness, and Intractability (Abstract) STOC (1977)
Kenneth L. Manders, Leonard M. Adleman
NP-Complete Decision Problems for Quadratic Polynomials STOC (1976)
Leonard M. Adleman, Kenneth L. Manders
Diophantine Complexity FOCS (1976)
Leonard M. Adleman, Kenneth L. Manders
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) FOCS (1975)
Leonard M. Adleman
Short permutation strings. Discret. Math. 10 (2) (1974)