Papers
2
Total Citations
162
H-Index
2
About
Len Adleman is a pioneering computer scientist whose work bridges theoretical computation, molecular biology, and cryptography. He is best known for co-inventing the RSA cryptosystem, a foundational technology for secure digital communication, and for founding the field of DNA computing. In 1994, Adleman demonstrated the first molecular computation using DNA strands to solve a Hamiltonian path problem, showing that biological molecules could perform complex calculations. His highly cited work on combinatorial optimization problems in self-assembly (143 citations) explores how simple objects can autonomously assemble into intricate structures, with implications for circuit fabrication, nano-robotics, and amorphous computing. Adleman’s research has had a profound impact on both computer science and molecular engineering, earning him the Turing Award in 2002 for his contributions to cryptography. His visionary ideas continue to inspire new approaches to computation and nanotechnology, making him a central figure in the development of unconventional computing paradigms.
Research Focus
Key Achievements
Top Papers
- 1Combinatorial optimization problems in self-assembly143 citations · 2002
- 2Combinatorial optimization problems in self-assembly19 citations · 2002