Leonard Adleman | Academic Influence

Leonard Adleman's AcademicInfluence.com Rankings

Leonard Adleman

Computer Science

#107

World Rank

#113

Historical Rank

#62

USA Rank

Theoretical Computer Science

#34

World Rank

#34

Historical Rank

#12

USA Rank

Database

#322

World Rank

#336

Historical Rank

#153

USA Rank

computer-science Degrees

Leonard Adleman

Biology

#395

World Rank

#706

Historical Rank

#236

USA Rank

Molecular Biology

#71

World Rank

#73

Historical Rank

#48

USA Rank

Computational Biology

#87

World Rank

#87

Historical Rank

#27

USA Rank

biology Degrees

Download Badge

Computer Science
Biology

Leonard Adleman's Degrees

PhD Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Leonard Adleman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Leonard Adleman is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award. He is also known for the creation of the field of DNA computing.

(See a Problem?)

Leonard Adleman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A method for obtaining digital signatures and public-key cryptosystems (1978) (10944)
A method for obtaining digital signatures and public-key cryptosystems (1978) (8694)
Molecular computation of solutions to combinatorial problems. (1994) (4204)
Proof of proposition 3 (1992) (816)
Proof of proposition 2 (1992) (798)
Solution of a 20-Variable 3-SAT Problem on a DNA Computer (2002) (523)
Proof of proposition 1 (1992) (489)
Two theorems on random polynomial time (1978) (335)
A subexponential algorithm for the discrete logarithm problem with applications to cryptography (1979) (260)
Quantum Computability (1997) (258)
On Digital Signatures and Public-Key Cryptosystems. (1977) (245)
On constructing a molecular computer (1995) (230)
Running time and program size for self-assembled squares (2001) (218)
A Sticker-Based Model for DNA Computation (1998) (201)
On distinguishing prime numbers from composite numbers (1980) (196)
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields (1994) (192)
Computing with DNA (1998) (175)
On applying molecular computation to the data encryption standard (1999) (167)
An Abstract Theory of Computer Viruses (1988) (160)
Combinatorial optimization problems in self-assembly (2002) (150)
On taking roots in finite fields (1977) (148)
The function field sieve (1994) (137)
Recognizing primes in random polynomial time (1987) (119)
Solution of a Satisfiability Problem on a Gel-Based DNA Computer (2000) (115)
Finding irreducible polynomials over finite fields (1986) (115)
Primality Testing and Abelian Varieties over Finite Fields (1992) (114)
Theory and experiments in algorithmic self-assembly (2001) (112)
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields (1993) (112)
NP-Complete Decision Problems for Binary Quadratics (1978) (106)
Function Field Sieve Method for Discrete Logarithms over Finite Fields (1999) (105)
Self-assembly of DNA double-double crossover complexes into high-density, doubly connected, planar structures. (2005) (94)
DNA triangles and self-assembled hexagonal tilings. (2004) (94)
Reducibility, randomness, and intractibility (Abstract) (1977) (84)
T-cell homeostasis: implications in HIV infection . (1993) (82)
Inductive inference and unsolvability (1991) (76)
On breaking generalized knapsack public key cryptosystems (1983) (68)
Open problems in number theoretic complexity, II (1994) (64)
Linear Self-Assemblies: Equilibria, Entropy and Convergence Rates (2003) (60)
A sticker based model for DNA computation (1996) (57)
Factoring numbers using singular integers (1991) (54)
On the decidability of self-assembly of infinite ribbons (2002) (52)
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem (1982) (51)
NP-complete decision problems for quadratic polynomials (1976) (43)
Diophantine complexity (1976) (40)
Irreducibility testing and factorization of polynomials (1981) (37)
Counting Points on Curves and Abelian Varieties Over Finite Fields (2001) (36)
Open Problems in Number Theoretic Complexity (1987) (34)
Primality Testing (1981) (34)
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q) (1999) (32)
Short permutation strings (1974) (31)
Using smoothness to achieve parallelism (1988) (30)
Blind T-cell homeostasis in CD4-deficient mice. (1996) (28)
The first case of Fermat's last theorem (1985) (28)
Computational complexity of decision procedures for polynomials (1975) (26)
Reductions that lie (1979) (25)
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields (1986) (25)
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (2009) (24)
Solving bivariate quadratic congruences in random polynomial time (1987) (23)
Algorithmic number theory-the complexity contribution (1994) (22)
An abstract theory of computer viruses (invited talk) (1990) (21)
The Story Of Non-Secret Encryption (1997) (20)
Pkcs #7: Cryptographic Message Syntax (1997) (19)
Efficient Checkers for Number-Theoretic Computations (1995) (17)
The use of public key cryptography in communication system design (1978) (15)
On the Mathematics of the Law of Mass Action (2008) (14)
An application of higher reciprocity to computational number theory (1982) (13)
Algorithmic Number Theory (1994) (12)
Number-theoretic aspects of computational complexity. (1976) (12)
Building blocks for DNA self-assembly (2004) (11)
Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings (1994) (7)
On Distinguishing Prime Numbers from Composite Numbers (Abstract) (1980) (7)
Implementing an Electronic Notary Public (1982) (6)
An (^{1/10.89}) primality testing algorithm (1981) (5)
Improved time and space bounds for Boolean matrix multiplication (1978) (5)
Space-bounded simulation of multitape turing machines (1981) (4)
Fast Checkers for Cryptography (1990) (4)
On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) (1983) (3)
Proceedings of the First International Symposium on Algorithmic Number Theory (1994) (2)
Using Smoothness to Achieve Parallelism (Abstract) (1988) (1)
Evidence of Systematic Bias in 2008 Presidential Polling (preliminary report) (2008) (1)
Irreducibility Testing and Factorization of Polynomials (Extended Abstract) (1981) (1)
Algorithmic Number Theory and Its Relationship to Computational Complexity (1995) (1)
An Algorithmic View of the Universe (2012) (0)
CPA-security for Padded RSA Tingxiang Zou (2014) (0)
An 0 ( nl / lM 9 ) Primality Testing Algorithm (2010) (0)
INTRACTABILITY PROOFS AND THE COMPUTATIONAL COMPLEXITY OF BINARY QUADRATICS (2015) (0)
A new computing paradigm based on DNA molecules is appeared in 1994 when (2003) (0)
PROJECTING COMPUTATIONAL POWER (2018) (0)
A FRAMEWORK FOR FAST CLASSIFICATION ALGORITHMS (2008) (0)
Efficient checking of computations in number theory (1994) (0)
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) (1975) (0)
Designing Money [Extended Abstract] (2018) (0)
Pre-RSA Days: History and Lessons (2007) (0)
Overview of the algorithm and the proof of the main theorem (1992) (0)
DNA Computing (2003) (0)
Reduction of main theorem to three propositions (1992) (0)

This paper list is powered by the following services:

Other Resources About Leonard Adleman

What Schools Are Affiliated With Leonard Adleman?

Leonard Adleman is affiliated with the following schools:

Image Attributions

Image Source for Leonard Adleman