Sneha Girap (Editor)

Leonard Adleman

Updated on
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality  American
Academic advisor  Manuel Blum
Awards  Turing Award
Role  Computer scientist
Name  Leonard Adleman

Leonard Adleman Leonard M Adleman AM Turing Award Winner

Full Name  Leonard Max Adleman
Born  December 31, 1945 (age 69) (1945-12-31) San Francisco, California, US
Alma mater  University of California, Berkley
Children  Stephanie Adleman, Lindsey Adleman, Jennifer Adleman
Education  University of California, Berkeley (1976), University of California, Berkeley (1968)
Employer  University of Southern California, Massachusetts Institute of Technology
Similar People  Ronald Rivest, Adi Shamir, Whitfield Diffie, Martin Hellman, Erik Winfree

Adleman's Molecular Toolbox

Leonard Adleman (born December 31, 1945) is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award, often called the Nobel prize of Computer science. He is also known for the creation of the field of DNA computing.


Leonard Adleman Leonard Max Adleman Heidelberg Laureate Forum


Leonard Adleman Leonard Adleman Wikipedia

Adleman was born in California. He grew up in San Francisco and attended the University of California, Berkeley, where he received his BA degree in mathematics in 1968 and his Ph.D. degree in EECS in 1976. He was also the mathematical consultant on the movie Sneakers. He is a member of the National Academy of Engineering and the National Academy of Sciences.

Adleman is also an amateur boxer and has sparred with James Toney.


In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system. In it, he solved a seven-node instance of the Hamiltonian Graph problem, an NP-complete problem similar to the travelling salesman problem. While the solution to a seven-node instance is trivial, this paper is the first known instance of the successful use of DNA to compute an algorithm. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.

In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation. Specifically, they solved a 20-variable SAT problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.

He is one of the original discoverers of the Adleman–Pomerance–Rumely primality test.

Fred Cohen, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus". He is also widely referred to as the Father of DNA Computing.

Currently, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.


For his contribution to the invention of the RSA cryptosystem, Adleman, along with Ron Rivest and Adi Shamir, has been a recipient of the 1996 Paris Kanellakis Theory and Practice Award and the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science. Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006.


Leonard Adleman Wikipedia