1. L. Adleman. TWO theorems on random polynomial time., In Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science, 75–83., IEEE Computer Society Press, 1978.
2. L. Adleman AND K. Manders., Reducibility, randomness, and intractibility., In Proceedings of the 9th ACM Symposium on Theory of Computing, 151–163. ACM Press, 1977
3. L. Adleman AND K. Manders., Reductions that lie. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, 397–410., IEEE Computer Society Press, 1979
4. E. Allender AND L. Hemachandra., Lower bounds for the low hierarchy., Journal of the ACM, 39: 234–250, 1992.
5. V. Arvind, J. Kobler, U. Schöning, AND R. Schuler., If NP has polynomial-size circuits, then MA=AM. Theoretical Computer Science, 137 (2): 279–282, 1995.