Leonard M. Adleman

37.7k total citations · 3 hit papers
64 papers, 19.7k citations indexed

About

Leonard M. Adleman is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Leonard M. Adleman has authored 64 papers receiving a total of 19.7k indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 21 papers in Computational Theory and Mathematics and 16 papers in Molecular Biology. Recurrent topics in Leonard M. Adleman's work include Coding theory and cryptography (17 papers), DNA and Biological Computing (14 papers) and Cryptography and Data Security (11 papers). Leonard M. Adleman is often cited by papers focused on Coding theory and cryptography (17 papers), DNA and Biological Computing (14 papers) and Cryptography and Data Security (11 papers). Leonard M. Adleman collaborates with scholars based in United States, Canada and United Kingdom. Leonard M. Adleman's co-authors include Ronald L. Rivest, Adi Shamir, Adi Shamir, Ming-Deh A. Huang, Kenneth L. Manders, N. V. Chelyapov, Paul W. K. Rothemund, Erik Winfree, Sam T. Roweis and David Wofsy and has published in prestigious journals such as Science, Journal of the American Chemical Society and Communications of the ACM.

In The Last Decade

Leonard M. Adleman

62 papers receiving 17.5k citations

Hit Papers

A method for obtaining digital signatures and public-key ... 1978 2026 1994 2010 1978 1983 1994 2.0k 4.0k 6.0k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A method for obtaining digital signatures and public-key cryptosystems
    1978 7.4k citations Ronald L. Rivest, Adi Shamir et al. Communications of the ACM profile →
  2. A method for obtaining digital signatures and public-key cryptosystems
    1983 7.2k citations Ronald L. Rivest, Adi Shamir et al. Communications of the ACM profile →
  3. Molecular Computation of Solutions to Combinatorial Problems
    1994 2.7k citations Leonard M. Adleman profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Leonard M. Adleman United States 26 12.1k 6.4k 4.7k 4.4k 3.5k 64 19.7k
John E. Hopcroft United States 56 6.3k 0.5× 1.1k 0.2× 2.4k 0.5× 4.7k 1.1× 1.5k 0.4× 171 18.3k
Thomas H. Cormen United States 16 4.8k 0.4× 1.4k 0.2× 2.5k 0.5× 6.5k 1.5× 1.0k 0.3× 44 16.3k
Richard M. Karp United States 73 6.2k 0.5× 2.3k 0.4× 1.7k 0.4× 14.6k 3.3× 3.6k 1.0× 263 28.9k
M. R. Garey United States 43 7.7k 0.6× 2.5k 0.4× 2.8k 0.6× 16.2k 3.7× 1.6k 0.5× 77 40.7k
Alfred V. Aho United States 43 10.7k 0.9× 3.4k 0.5× 1.1k 0.2× 6.1k 1.4× 1.6k 0.5× 116 21.1k
Charles E. Leiserson United States 46 5.9k 0.5× 3.0k 0.5× 3.0k 0.6× 13.0k 3.0× 1.1k 0.3× 142 25.1k
David Harel Israel 53 7.2k 0.6× 2.9k 0.5× 1.1k 0.2× 2.4k 0.5× 1.1k 0.3× 255 15.3k
Adi Shamir Israel 31 14.9k 1.2× 6.3k 1.0× 6.0k 1.3× 5.7k 1.3× 390 0.1× 93 20.5k
Jeffrey D. Ullman United States 76 16.6k 1.4× 8.3k 1.3× 1.8k 0.4× 14.3k 3.2× 1.5k 0.4× 300 31.7k
Leslie G. Valiant United States 44 9.4k 0.8× 1.1k 0.2× 1.5k 0.3× 4.6k 1.0× 638 0.2× 99 16.7k

Countries citing papers authored by Leonard M. Adleman

Since Specialization
Citations

This map shows the geographic impact of Leonard M. Adleman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leonard M. Adleman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonard M. Adleman more than expected).

Fields of papers citing papers by Leonard M. Adleman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leonard M. Adleman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leonard M. Adleman. The network helps show where Leonard M. Adleman may publish in the future.

Co-authorship network of co-authors of Leonard M. Adleman

This figure shows the co-authorship network connecting the top 25 collaborators of Leonard M. Adleman. A scholar is included among the top collaborators of Leonard M. Adleman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leonard M. Adleman. Leonard M. Adleman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Brun, Yuriy, et al.. (2004). Building blocks for DNA self-assembly. 7 indexed citations
2.
Adleman, Leonard M. & Ming-Deh A. Huang. (2001). Counting Points on Curves and Abelian Varieties Over Finite Fields. Journal of Symbolic Computation. 32(3). 171–189. 11 indexed citations
3.
Adleman, Leonard M. & Ming-Deh A. Huang. (1999). Function Field Sieve Method for Discrete Logarithms over Finite Fields. Information and Computation. 151(1-2). 5–16. 24 indexed citations
4.
Adleman, Leonard M., et al.. (1999). A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF(q). Theoretical Computer Science. 226(1-2). 7–18. 7 indexed citations
5.
Adleman, Leonard M., Paul W. K. Rothemund, Sam T. Roweis, & Erik Winfree. (1999). On Applying Molecular Computation to the Data Encryption Standard. Journal of Computational Biology. 6(1). 53–63. 92 indexed citations
6.
Roweis, Sam T., Erik Winfree, N. V. Chelyapov, et al.. (1998). A Sticker-Based Model for DNA Computation. Journal of Computational Biology. 5(4). 615–629. 140 indexed citations
7.
Adleman, Leonard M.. (1996). "Counting rational points on curves and abelian varieties over finite fields," Proc. of ANTS-2. Lecture notes in computer science. 1122. 1–16. 3 indexed citations
8.
Adleman, Leonard M. & David Wofsy. (1996). Blind T-Cell Homeostasis in CD4-Deficient Mice. Journal of Acquired Immune Deficiency Syndromes & Human Retrovirology. 11(4). 334–340. 21 indexed citations
9.
Adleman, Leonard M., et al.. (1995). Efficient Checkers for Number-Theoretic Computations. Information and Computation. 121(1). 93–102. 15 indexed citations
10.
Adleman, Leonard M. & Manuel Blum. (1991). Inductive inference and unsolvability. Journal of Symbolic Logic. 56(3). 891–900. 31 indexed citations
11.
Adleman, Leonard M.. (1990). An abstract theory of computer viruses. 307–323. 20 indexed citations
12.
Adleman, Leonard M.. (1990). An abstract theory of computer viruses (invited talk). 354–374. 10 indexed citations
13.
Adleman, Leonard M. & Andrew Odlyzko. (1983). Irreducibility Testing and Factorization of Polynomials. Mathematics of Computation. 41(164). 699–699. 2 indexed citations
14.
Adleman, Leonard M. & Andrew Odlyzko. (1983). Irreducibility testing and factorization of polynomials. Mathematics of Computation. 41(164). 699–709. 9 indexed citations
15.
Rivest, Ronald L., Adi Shamir, & Leonard M. Adleman. (1983). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM. 26(1). 96–99. 7211 indexed citations breakdown →
16.
Adleman, Leonard M.. (1978). Two theorems on random polynomial time. 75–83. 185 indexed citations
17.
Manders, Kenneth L. & Leonard M. Adleman. (1978). NP-Complete decision problems for binary quadratics. Journal of Computer and System Sciences. 16(2). 168–184. 50 indexed citations
18.
Rivest, Ronald L., Adi Shamir, & Leonard M. Adleman. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM. 21(2). 120–126. 7360 indexed citations breakdown →
19.
Adleman, Leonard M. & Kenneth L. Manders. (1975). Computational Complexity of Decision Procedures for Polynomials (Extended Abstract). 169–177.
20.
Adleman, Leonard M.. (1974). Short permutation strings. Discrete Mathematics. 10(2). 197–200. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by John E. Hopcroft Breakdown of academic impact, for papers by Thomas H. Cormen Breakdown of academic impact, for papers by Richard M. Karp Breakdown of academic impact, for papers by M. R. Garey Breakdown of academic impact, for papers by Alfred V. Aho Breakdown of academic impact, for papers by Charles E. Leiserson Breakdown of academic impact, for papers by David Harel Breakdown of academic impact, for papers by Adi Shamir Breakdown of academic impact, for papers by Jeffrey D. Ullman Breakdown of academic impact, for papers by Leslie G. Valiant
Rankless by CCL
2026