1. L. M. Adleman, “Algorithmic Number Theory–The Complexity Contribution”, Proceedings of the 35thAnnual IEEE Symposium on Foundations of Computer Science, IEEE Press, 1994, 88–113.
2. L. M. Adleman, C. Pomerance, and R. S. Rumely, “On Distinguishing Prime Numbers from Composite Numbers”, Annals of Mathematics, 117 (1983), 173–206.
3. L. M. Adleman and M. D. A. Huang, Primality Testing and Abelian Varieties over Finite Fields, Lecture Notes in Mathematics 1512, Springer-Verlag, 1992.
4. M. Agrawal, N. Kayal and N. Saxena, Primes is in P, Dept of Computer Science & Engineering, Indian Institute of Technology Kanpur, India, 6 August 2002.
5. W. Alford, G. Granville and C. Pomerance, “There Are Infinitely Many Carmichael Numbers”, Annals of Mathematics, 140 (1994), 703–722.