2026 Leonard M. Adleman: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	National Ranking	Publications	Citations
Computer Science	41	8546	3652	73	40665

Leonard M. Adleman publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Leonard M. Adleman sits on this spectrum.

32 publications 991+

This scientist: 73 publications — 2nd percentile

2% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Leonard M. Adleman D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Leonard M. Adleman sits on this spectrum.

30 D-Index 131+

This scientist: 41 D-Index — 40th percentile

40% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

2006 - Member of the National Academy of Sciences
2006 - Fellow of the American Academy of Arts and Sciences
2002 - A. M. Turing Award Together with Ronald Rivest and Adi Shamir, for their ingenious contribution to making public-key cryptography useful in practice.
2000 - IEEE Koji Kobayashi Computers and Communications Award “For the revolutionary invention of the RSA public key cryptosystem which is the first to be widelyadopted.”
1996 - ACM Paris Kanellakis Theory and Practice Award Public-Key Cryptography
1996 - Member of the National Academy of Engineering For contributions to the theory of computation and cryptography.

Overview

Leonard M. Adleman is affiliated with the University of Southern California in the United States. The scientist's research spans multiple fields, primarily Social Sciences and Computer Science. Within these broad areas, the subfields of Sociology and Political Science, as well as Artificial Intelligence, are notably represented in their recent work.

The main topics of Leonard M. Adleman's research focus on Evolutionary Game Theory and Cooperation, alongside Evolutionary Algorithms and Applications. These areas reflect an interdisciplinary approach that bridges theoretical and applied domains.

Among the recent scholarly contributions is a paper titled "Darwin Turing Dawkins: Building a General Theory of Evolution", published in 2024 in the venue arXiv (Cornell University).

"Darwin Turing Dawkins: Building a General Theory of Evolution" (2024, arXiv - Cornell University)

Throughout their research career, Leonard M. Adleman has published in venues including:

arXiv (Cornell University)

Several prestigious recognitions have been awarded to Leonard M. Adleman for contributions to the theory of computation and cryptography:

Member of the National Academy of Sciences (2006)
Fellow of the American Academy of Arts and Sciences (2006)
A. M. Turing Award (2002) - Awarded along with Ronald Rivest and Adi Shamir for the invention and practical application of public-key cryptography
IEEE Koji Kobayashi Computers and Communications Award (2000) - For the invention of the RSA public key cryptosystem
Member of the National Academy of Engineering (1996) - For contributions to theory of computation and cryptography
ACM Paris Kanellakis Theory and Practice Award (1996) - For work in public-key cryptography

Best Publications

A method for obtaining digital signatures and public-key cryptosystems

R. L. Rivest;A. Shamir;L. Adleman

25245
Citations
Molecular computation of solutions to combinatorial problems

Leonard M. Adleman

6288
Citations
Cryptographic communications system and method

Ronald L. Rivest;Adi Shamir;Leonard M. Adleman

1652
Citations
Solution of a 20-Variable 3-SAT Problem on a DNA Computer

Ravinderjit S. Braich;Nickolas Chelyapov;Cliff Johnson;Paul W. K. Rothemund

836
Citations
Two theorems on random polynomial time

Leonard Adleman

470
Citations
A sticker-based model for DNA computation.

Sam T. Roweis;Erik Winfree;Richard Burgoyne;Nickolas V. Chelyapov

412
Citations
Quantum Computability

Leonard M. Adleman;Jonathan DeMarrais;Ming-Deh A. Huang

402
Citations
On distinguishing prime numbers from composite numbers

Leonard M. Adleman;Carl Pomerance;Robert S. Rumely

392
Citations
A subexponential algorithm for the discrete logarithm problem with applications to cryptography

Leonard Adleman

303
Citations
On applying molecular computation to the data encryption standard.

Leonard M. Adleman;Paul W. K. Rothemund;Sam T. Roweis;Erik Winfree

278
Citations
Running time and program size for self-assembled squares

Leonard Adleman;Qi Cheng;Ashish Goel;Ming-Deh Huang

260
Citations
On constructing a molecular computer.

Leonard M. Adleman

244
Citations
Solution of a satisfiability problem on a gel-based DNA computer

Ravinderjit S. Braich;Cliff Johnson;Paul W. K. Rothemund;Darryl Hwang

234
Citations
On taking roots in finite fields

Leonard Adleman;Kenneth Manders;Gary Miller

229
Citations
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

Leonard M. Adleman;Jonathan DeMarrais;Ming-Deh A. Huang

210
Citations
Combinatorial optimization problems in self-assembly

Len Adleman;Qi Cheng;Ashish Goel;Ming-Deh Huang

192
Citations
Theory and experiments in algorithmic self-assembly

Leonard M. Adleman;Paul Wilhelm Karl Rothemund

187
Citations
An abstract theory of computer viruses

Leonard M. Adleman

182
Citations
Finding irreducible polynomials over finite fields

L M Adleman;H W Lenstra

152
Citations
The function field sieve

Leonard M. Adleman

146
Citations

Frequent Co-Authors

Erik Winfree California Institute of Technology

Ronald L. Rivest MIT

Sam T. Roweis New York University

Adi Shamir Weizmann Institute of Science

Yuriy Brun University of Massachusetts Amherst

Andrew M. Odlyzko University of Minnesota

Gary L. Miller Carnegie Mellon University

Lila Kari University of Waterloo

Franco P. Preparata Brown University

David Wofsy University of California, San Francisco

External Links

Wikipedia of Leonard M. Adleman Personal website of Leonard M. Adleman

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Considering a career in Computer Science opens doors to a range of online degrees that can complement or expand your expertise. Many students opt for a fast track computer science degree, which allows you to earn your qualification faster and enter the workforce sooner. These programs are ideal for career switchers or those looking to accelerate advancement.

If you’re interested in environmental issues, pursuing environmental engineering schools online can prepare you for roles that blend technology and sustainability. Similarly, a mechanical engineering degree online cost is becoming more affordable, making it easier to combine your interest in engineering and computing.

For those passionate about scientific research and data analysis, an online physics degree can open pathways to high-tech industries or advanced academic study. Each of these online programs offers the flexibility and specialized knowledge to move your technology career forward from wherever you are.