Leonard M. Adleman

According to our database1, Leonard M. Adleman
  • authored at least 53 papers between 1974 and 2012.
  • has a "Dijkstra number"2 of three.

Awards

Turing Prize recipient

Turing Prize 2002, "For RSA (algorithm)|their ingenious contribution for making public-key cryptography useful in practice." awarded to Ronald L. Rivest and Adi Shamir and Leonard M. Adleman.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2012
An Algorithmic View of the Universe.
Proceedings of the ACM Turing Centenary Celebration, 2012

2009
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.
SIAM J. Comput., 2009

2002
Combinatorial optimization problems in self-assembly.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

On the Decidability of Self-Assembly of Infinite Ribbons.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Counting Points on Curves and Abelian Varieties Over Finite Fields.
J. Symb. Comput., 2001

Running time and program size for self-assembled squares.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Solution of a Satisfiability Problem on a Gel-Based DNA Computer.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q).
Theor. Comput. Sci., 1999

On Applying Molecular Computation to the Data Encryption Standard.
Journal of Computational Biology, 1999

Function Field Sieve Method for Discrete Logarithms over Finite Fields.
Inf. Comput., 1999

1998
A Sticker-Based Model for DNA Computation.
Journal of Computational Biology, 1998

1997
Quantum Computability.
SIAM J. Comput., 1997

1996
A sticker based model for DNA computation.
Proceedings of the DNA Based Computers, 1996

On applying molecular computation to the data encryption standard.
Proceedings of the DNA Based Computers, 1996

Counting Rational Points on Curves and Abelian Varieties over Finite Fields.
Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995
Efficient Checkers for Number-Theoretic Computations
Inf. Comput., August, 1995

On constructing a molecular computer.
Proceedings of the DNA Based Computers, 1995

Algorithmic Number Theory and Its Relationship to Computational Complexity.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
Algorithmic Number Theory-The Complexity Contribution
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Open problems in number theoretic complexity, II.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

Efficient checking of computations in number theory.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

The function field sieve.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields.
Proceedings of the Advances in Cryptology, 1993

1991
Inductive Inference and Unsolvability.
J. Symb. Log., 1991

Factoring Numbers Using Singular Integers
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990
Fast Checkers for Cryptography.
Proceedings of the Advances in Cryptology, 1990

1988
Using Smoothness to Achieve Parallelism (Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

An Abstract Theory of Computer Viruses.
Proceedings of the Advances in Cryptology, 1988

1987
Recognizing Primes in Random Polynomial Time
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Finding Irreducible Polynomials over Finite Fields
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields.
Proceedings of the Advances in Cryptology, 1985

1983
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).
Commun. ACM, 1983

On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
An Application of Higher Reciprocity to Computational Number Theory (Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

Implementing an Electronic Notary Public.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
Space-Bounded Simulation of Multitape Turing Machines.
Mathematical Systems Theory, 1981

Irreducibility Testing and Factorization of Polynomials (Extended Abstract)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Primality Testing.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
On Distinguishing Prime Numbers from Composite Numbers (Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Reductions that Lie
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
NP-Complete Decision Problems for Binary Quadratics.
J. Comput. Syst. Sci., 1978

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Commun. ACM, 1978

Improved Time and Space Bounds for Boolean Matrix Multiplication.
Acta Inf., 1978

Two Theorems on Random Polynomial Time
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Reducibility, Randomness, and Intractability (Abstract)
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

On Taking Roots in Finite Fields
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
NP-Complete Decision Problems for Quadratic Polynomials
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Diophantine Complexity
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
Short permutation strings.
Discrete Mathematics, 1974


  Loading...