• Leonard Max Adleman is an American computer scientist.
  • He was born on December 31, 1945 in California.
  • Adleman grew up in San Francisco and attended the University of California, Berkeley
  • He received his BA degree in mathematics in 1968 and his Ph.D. degree in EECS in 1976.
  • In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system.
  • la2
  • In it, he solved a seven-node instance of the Hamiltonian Graph problem
  • In 2002, he and his research group managed to solve a ‘nontrivial’ problem using DNA computation
  • He is now a professor of computer science and molecular biology at the University of Southern California.
  • la4                    la3



  • Paris Kanellakis Theory and Practice Award in 1996
  • ACM Turing Award in 2002
  • Elected a Fellow of the American Academy of Arts and Sciences in 2006.
  • Member of the National Academy of Engineering and the National Academy of Sciences.