S9.com / Biographies /
Adleman, Leonard
Currently alive, at 62 years of age.
Nationality: American
Categories: Computer Scientist
1945 - Born on the 31st of December in California.
1968 - He attended the University of California, Berkely, where he received his Bachelor of Arts in mathematics.
1976 - Received his Ph.D at the University of California, Berkeley.
1977 - He is known for being a co-inventor of the Rivest-Shamir-Adleman cryptosystem, and of DNA computing.
1992 - He was the mathematical consultant on the movie Sneakers.
1994 - His paper Molecular Computation of Solution To Combinatorial Problems described the experimental use
of DNA as a computational system.
- He solved a seven-node instance of the Hamiltonian Graph problem, an NP-complete.
2002 - He and his research group managed to solve a 'nontrivial' problem using DNA computation.
- He was a recipient along with Ron Rivest and Adi Shamir of the ACM Turing Award, often called the Nobel
Prize of Computer Science.
| | Page last updated: 6:41pm, 21st May '07 |
Related Books
  |
Algorithmic Number Theory: First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings (Lecture Notes in Computer Science) (Paperback - Dec 16, 1994) This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.The 35 papers accepted for inclusion in this... Usually ships in 24 hours |
 |
  |
Intractability proofs and the computational complexity of binary quadratics (Memorandum) by Leonard Max Adleman (Unknown Binding - Aug 20, 1978) |
|
 |
Time, space and randomness (MIT/LCS/TM-131) by Leonard M Adleman (Unknown Binding - Aug 20, 1979) |
|
 |
Space-bounded simulation of multitape Turing machines (MIT/LCS/TM-148) by Leonard M Adleman (Unknown Binding - Aug 20, 1979) |
|
  |
Primality Testing and Abelian Varieties Over Finite Fields (Lecture Notes in Mathematics) by Leonard M. Adleman and Ming-Deh A. Huang (Paperback - Apr 30, 1992) From Gauss to G|del, mathematicians have sought an efficient algorithm to distinguish prime numbers from composite numbers. This book presents a random polynomial time algorithm for the... Usually ships in 24 hours |
|
