1. A subexponential algorithm for the discrete logarithm problem with applications to cryptography;Adleman,1979
2. Reducibility, randomness and intractibility;Adleman,1977
3. On New Foundations for Cryptology;Adleman,1980
4. Monte Carlo Algorithms in Graph Isomorphism Testing;Babai,1979
5. Relativizations of the P = ?NP question;Baker;SIAM J. Comput.,1975