| 2009 |
|---|
| 49 | EE | 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 |
|---|
| 48 | EE | Leonard M. Adleman,
Jarkko Kari,
Lila Kari,
Dustin Reishus:
On the Decidability of Self-Assembly of Infinite Ribbons.
FOCS 2002: 530-537 |
| 47 | EE | 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 |
|---|
| 46 | EE | Leonard M. Adleman,
Qi Cheng,
Ashish Goel,
Ming-Deh A. Huang:
Running time and program size for self-assembled squares.
STOC 2001: 740-748 |
| 45 | | 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) |
| 2000 |
|---|
| 44 | EE | 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 |
| 1999 |
|---|
| 43 | | 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) |
| 42 | | Leonard M. Adleman,
Paul W. K. Rothemund,
Sam T. Roweis,
Erik Winfree:
On Applying Molecular Computation to the Data Encryption Standard.
Journal of Computational Biology 6(1): 53-64 (1999) |
| 41 | EE | 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 |
|---|
| 40 | | 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.
Journal of Computational Biology 5(4): 615-630 (1998) |
| 1997 |
|---|
| 39 | | Leonard M. Adleman,
Jonathan DeMarrais,
Ming-Deh A. Huang:
Quantum Computability.
SIAM J. Comput. 26(5): 1524-1540 (1997) |
| 1996 |
|---|
| 38 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Counting Rational Points on Curves and Abelian Varieties over Finite Fields.
ANTS 1996: 1-16 |
| 1995 |
|---|
| 37 | | Leonard M. Adleman:
Algorithmic Number Theory and Its Relationship to Computational Complexity.
Computer Science Today 1995: 159-171 |
| 36 | | Leonard M. Adleman,
Ming-Deh A. Huang,
Kireeti Kompella:
Efficient Checkers for Number-Theoretic Computations
Inf. Comput. 121(1): 93-102 (1995) |
| 1994 |
|---|
| 35 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings
Springer 1994 |
| 34 | | Leonard M. Adleman:
The function field sieve.
ANTS 1994: 108-121 |
| 33 | | Leonard M. Adleman,
Ming-Deh A. Huang,
Kireeti Kompella:
Efficient checking of computations in number theory.
ANTS 1994: 249 |
| 32 | | 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 |
| 31 | | Leonard M. Adleman,
Kevin S. McCurley:
Open problems in number theoretic complexity, II.
ANTS 1994: 291-322 |
| 30 | | Leonard M. Adleman:
Algorithmic Number Theory-The Complexity Contribution
FOCS 1994: 88-113 |
| 1993 |
|---|
| 29 | EE | Leonard M. Adleman,
Jonathan DeMarrais:
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields.
CRYPTO 1993: 147-158 |
| 1991 |
|---|
| 28 | | Leonard M. Adleman:
Factoring Numbers Using Singular Integers
STOC 1991: 64-71 |
| 27 | | Leonard M. Adleman,
Manuel Blum:
Inductive Inference and Unsolvability.
J. Symb. Log. 56(3): 891-900 (1991) |
| 1990 |
|---|
| 26 | EE | Kireeti Kompella,
Leonard M. Adleman:
Fast Checkers for Cryptography.
CRYPTO 1990: 515-529 |
| 1988 |
|---|
| 25 | EE | Leonard M. Adleman:
An Abstract Theory of Computer Viruses.
CRYPTO 1988: 354-374 |
| 24 | | Leonard M. Adleman,
Kireeti Kompella:
Using Smoothness to Achieve Parallelism (Abstract)
STOC 1988: 528-538 |
| 1987 |
|---|
| 23 | | Leonard M. Adleman,
Ming-Deh A. Huang:
Recognizing Primes in Random Polynomial Time
STOC 1987: 462-469 |
| 1986 |
|---|
| 22 | | Leonard M. Adleman,
Hendrik W. Lenstra Jr.:
Finding Irreducible Polynomials over Finite Fields
STOC 1986: 350-355 |
| 1985 |
|---|
| 21 | EE | 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: 3-13 |
| 1983 |
|---|
| 20 | | Leonard M. Adleman:
On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract)
STOC 1983: 402-412 |
| 19 | | 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) |
| 1982 |
|---|
| 18 | | Leonard M. Adleman:
Implementing an Electronic Notary Public.
CRYPTO 1982: 259-265 |
| 17 | | Leonard M. Adleman:
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem.
CRYPTO 1982: 303-308 |
| 16 | | Leonard M. Adleman,
Robert McDonnell:
An Application of Higher Reciprocity to Computational Number Theory (Abstract)
FOCS 1982: 100-106 |
| 1981 |
|---|
| 15 | | Leonard M. Adleman:
Primality Testing.
CRYPTO 1981: 10 |
| 14 | | Leonard M. Adleman,
Andrew M. Odlyzko:
Irreducibility Testing and Factorization of Polynomials (Extended Abstract)
FOCS 1981: 409-418 |
| 13 | | Leonard M. Adleman,
Michael C. Loui:
Space-Bounded Simulation of Multitape Turing Machines.
Mathematical Systems Theory 14: 215-222 (1981) |
| 1980 |
|---|
| 12 | | Leonard M. Adleman:
On Distinguishing Prime Numbers from Composite Numbers (Abstract)
FOCS 1980: 387-406 |
| 1979 |
|---|
| 11 | | Leonard M. Adleman,
Kenneth L. Manders:
Reductions that Lie
FOCS 1979: 397-410 |
| 10 | | Leonard M. Adleman:
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract)
FOCS 1979: 55-60 |
| 1978 |
|---|
| 9 | | Leonard M. Adleman:
Two Theorems on Random Polynomial Time
FOCS 1978: 75-83 |
| 8 | | Leonard M. Adleman,
Kellogg S. Booth,
Franco P. Preparata,
Walter L. Ruzzo:
Improved Time and Space Bounds for Boolean Matrix Multiplication.
Acta Inf. 11: 61-77 (1978) |
| 7 | | 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) |
| 6 | | Kenneth L. Manders,
Leonard M. Adleman:
NP-Complete Decision Problems for Binary Quadratics.
J. Comput. Syst. Sci. 16(2): 168-184 (1978) |
| 1977 |
|---|
| 5 | | Leonard M. Adleman,
Kenneth L. Manders,
Gary L. Miller:
On Taking Roots in Finite Fields
FOCS 1977: 175-178 |
| 4 | | Leonard M. Adleman,
Kenneth L. Manders:
Reducibility, Randomness, and Intractability (Abstract)
STOC 1977: 151-163 |
| 1976 |
|---|
| 3 | | Leonard M. Adleman,
Kenneth L. Manders:
Diophantine Complexity
FOCS 1976: 81-88 |
| 2 | | Kenneth L. Manders,
Leonard M. Adleman:
NP-Complete Decision Problems for Quadratic Polynomials
STOC 1976: 23-29 |
| 1975 |
|---|
| 1 | | Leonard M. Adleman,
Kenneth L. Manders:
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)
FOCS 1975: 169-177 |
