default search action
Leonard M. Adleman
Person information
- affiliation: University of Southern California, Department of Computer Science
- award (2002): Turing Award
- award (1996): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Leonard M. Adleman:
Darwin Turing Dawkins: Building a General Theory of Evolution. CoRR abs/2402.10393 (2024)
2010 – 2019
- 2012
- [c37]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: 13:1
2000 – 2009
- 2009
- [j15]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): 2356-2381 (2009) - 2002
- [c36]Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus:
On the Decidability of Self-Assembly of Infinite Ribbons. FOCS 2002: 530-537 - [c35]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: 23-32 - 2001
- [j14]Leonard M. Adleman, Ming-Deh A. Huang:
Counting Points on Curves and Abelian Varieties Over Finite Fields. J. Symb. Comput. 32(3): 171-189 (2001) - [c34]Leonard M. Adleman, Qi Cheng
Running time and program size for self-assembled squares. STOC 2001: 740-748 - 2000
- [c33]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: 27-42
1990 – 1999
- 1999
- [j13]Leonard M. Adleman, Ming-Deh A. Huang:
Function Field Sieve Method for Discrete Logarithms over Finite Fields. Inf. Comput. 151(1-2): 5-16 (1999) - [j12]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): 53-63 (1999) - [j11]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): 7-18 (1999) - 1998
- [j10]Sam T. Roweis, Erik Winfree
A Sticker-Based Model for DNA Computation. J. Comput. Biol. 5(4): 615-629 (1998) - 1997
- [j9]Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang:
Quantum Computability. SIAM J. Comput. 26(5): 1524-1540 (1997) - 1996
- [c32]Leonard M. Adleman, Ming-Deh A. Huang:
Counting Rational Points on Curves and Abelian Varieties over Finite Fields. ANTS 1996: 1-16 - [c31]Sam T. Roweis, Erik Winfree
A sticker based model for DNA computation. DNA Based Computers 1996: 1-29 - [c30]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: 31-44 - 1995
- [j8]Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
Efficient Checkers for Number-Theoretic Computations. Inf. Comput. 121(1): 93-102 (1995) - [c29]Leonard M. Adleman:
On constructing a molecular computer. DNA Based Computers 1995: 1-21 - [p1]Leonard M. Adleman:
Algorithmic Number Theory and Its Relationship to Computational Complexity. Computer Science Today 1995: 159-171 - 1994
- [c28]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: 28-40 - [c27]Leonard M. Adleman:
The function field sieve. ANTS 1994: 108-121 - [c26]Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
Efficient checking of computations in number theory. ANTS 1994: 249 - [c25]Leonard M. Adleman, Kevin S. McCurley
Open problems in number theoretic complexity, II. ANTS 1994: 291-322 - [c24]Leonard M. Adleman:
Algorithmic Number Theory-The Complexity Contribution. FOCS 1994: 88-113 - [e1]Leonard M. Adleman, Ming-Deh A. Huang:
Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. Lecture Notes in Computer Science 877, Springer 1994, ISBN 3-540-58691-1 [contents] - 1993
- [c23]Leonard M. Adleman, Jonathan DeMarrais:
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. CRYPTO 1993: 147-158 - 1991
- [j7]Leonard M. Adleman, Manuel Blum:
Inductive Inference and Unsolvability. J. Symb. Log. 56(3): 891-900 (1991) - [c22]Leonard M. Adleman:
Factoring Numbers Using Singular Integers. STOC 1991: 64-71 - 1990
- [c21]Kireeti Kompella, Leonard M. Adleman:
Fast Checkers for Cryptography. CRYPTO 1990: 515-529
1980 – 1989
- 1988
- [c20]Leonard M. Adleman:
An Abstract Theory of Computer Viruses. CRYPTO 1988: 354-374 - [c19]Leonard M. Adleman, Kireeti Kompella:
Using Smoothness to Achieve Parallelism (Abstract). STOC 1988: 528-538 - 1987
- [c18]Leonard M. Adleman, Ming-Deh A. Huang:
Recognizing Primes in Random Polynomial Time. STOC 1987: 462-469 - 1986
- [c17]Leonard M. Adleman, Hendrik W. Lenstra Jr.:
Finding Irreducible Polynomials over Finite Fields. STOC 1986: 350-355 - 1985
- [c16]Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. CRYPTO 1985: 3-13 - 1983
- [j6]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). Commun. ACM 26(1): 96-99 (1983) - [c15]Leonard M. Adleman:
On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract). STOC 1983: 402-412 - 1982
- [c14]Leonard M. Adleman:
Implementing an Electronic Notary Public. CRYPTO 1982: 259-265 - [c13]Leonard M. Adleman:
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem. CRYPTO 1982: 303-308 - [c12]Leonard M. Adleman, Robert McDonnell:
An Application of Higher Reciprocity to Computational Number Theory (Abstract). FOCS 1982: 100-106 - 1981
- [j5]Leonard M. Adleman, Michael C. Loui:
Space-Bounded Simulation of Multitape Turing Machines. Math. Syst. Theory 14: 215-222 (1981) - [c11]Leonard M. Adleman:
Primality Testing. CRYPTO 1981: 10 - [c10]Leonard M. Adleman, Andrew M. Odlyzko:
Irreducibility Testing and Factorization of Polynomials (Extended Abstract). FOCS 1981: 409-418 - 1980
- [c9]Leonard M. Adleman:
On Distinguishing Prime Numbers from Composite Numbers (Abstract). FOCS 1980: 387-406
1970 – 1979
- 1979
- [c8]Leonard M. Adleman:
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract). FOCS 1979: 55-60 - [c7]Leonard M. Adleman, Kenneth L. Manders:
Reductions that Lie. FOCS 1979: 397-410 - 1978
- [j4]Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica 11: 61-77 (1978) - [j3]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21(2): 120-126 (1978) - [j2]Kenneth L. Manders, Leonard M. Adleman:
NP-Complete Decision Problems for Binary Quadratics. J. Comput. Syst. Sci. 16(2): 168-184 (1978) - [c6]Leonard M. Adleman:
Two Theorems on Random Polynomial Time. FOCS 1978: 75-83 - 1977
- [c5]Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller:
On Taking Roots in Finite Fields. FOCS 1977: 175-178 - [c4]Leonard M. Adleman, Kenneth L. Manders:
Reducibility, Randomness, and Intractability (Abstract). STOC 1977: 151-163 - 1976
- [c3]Leonard M. Adleman, Kenneth L. Manders:
Diophantine Complexity. FOCS 1976: 81-88 - [c2]Kenneth L. Manders, Leonard M. Adleman:
NP-Complete Decision Problems for Quadratic Polynomials. STOC 1976: 23-29 - 1975
- [c1]Leonard M. Adleman, Kenneth L. Manders:
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract). FOCS 1975: 169-177 - 1974
- [j1]Leonard M. Adleman:
Short permutation strings. Discret. Math. 10(2): 197-200 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: