Leonard M. Adleman

Papers

Total Citations

253

H-Index

About

Leonard M. Adleman is a visionary computer scientist whose work bridges computation and molecular biology. Best known as the "A" in the RSA encryption algorithm—a foundational contribution to modern cryptography—his research spans theoretical computer science, number theory, and DNA computing. Adleman’s most influential work includes pioneering the field of DNA computation, where he demonstrated that biological molecules could solve mathematical problems. His 1998 paper, *"A Sticker-Based Model for DNA Computation"* (218 citations), introduced an innovative approach using DNA strands and hybridization to represent and process information, offering a simpler, more efficient alternative to earlier models. This work has inspired decades of research into molecular-scale computing. With over 35,000 total citations, Adleman’s impact is immense: his RSA algorithm remains a cornerstone of secure digital communication, and his DNA computing models opened new frontiers in biocomputing. A professor at the University of Southern California, Adleman’s achievements include the 2002 Turing Award, cementing his legacy as a thinker who reshaped both theory and application in computing.