• go to Frances Allen's profile page
  • go to Maurice V. Wilkes's profile page
  • go to Jim Gray 's profile page
  • go to Stephen A Cook's profile page
  • go to Ivan Sutherland's profile page
  • go to John L Hennessy's profile page
  • go to Michael Stonebraker's profile page
  • go to Donald E. Knuth's profile page
  • go to Adi Shamir's profile page
  • go to Edsger W. Dijkstra's profile page
  • go to Kenneth Lane Thompson's profile page
  • go to E. Allen Emerson's profile page
  • go to Yann LeCun's profile page
  • go to Niklaus E. Wirth's profile page
  • go to Kristen Nygaard 's profile page
  • go to Richard Karp's profile page
  • go to Edgar F. Codd's profile page
  • go to William Kahan's profile page
  • go to John E Hopcroft's profile page
  • go to Robert E Tarjan's profile page
  • go to Silvio Micali's profile page
  • go to Ronald L Rivest's profile page
  • go to Fernando Corbato's profile page
  • go to Martin Hellman 's profile page

Leonard (Len) Max Adleman DL Author Profile link

United States – 2002
Short Annotated Bibliography
  1. Rivest, R. L., A. Shamir and L. Adleman “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, Volume 21, Num. 2, Feb. 1978. Available here. This is the famous paper that introduced the practical public-key encryption system.
  2. Adleman, Leonard M.; Pomerance, Carl; Rumely, Robert S. (1983). "On distinguishing prime numbers from composite numbers," Annals of Mathematics, Vol. 117, Num. 1, pp. 173–206. Available here. In this significant paper the authors describe a new algorithm for primality testing, and prove that it always correctly decides the [non] primality of an integer n in almost polynomial time.
  3. Adleman, L. and M. Huang, “Recognizing primes in random polynomial time,” Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 462-469. Available here. This paper is the first in a series that prove the existence of a random polynomial time algorithm for the set of primes.
  4. Adleman, L., “Molecular computation of solutions to combinatorial problems,” Science, Vol. 266, Num. 5187, pp. 1021-1024, November 1994. Available here. This paper describes how the tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrated the feasibility of carrying out computations at the molecular level.
  5. Adleman L.M. and D.R. Heath-Brown. "The first case of Fermat's last theorem," Inventiones Mathematicae, Vol. 79, Num. 2 (June 1985), pp. 409–416. Available here.