1. S.O. Aanderaa. On k-tape versus (k-l)-tape real-time computation. In R.M. Karp, editor, Complexity of Computation, pages 75–96, American Math. Society, Providence, R.I., 1974.
2. L. Adleman. Time, space, and randomness. Technical Report MIT/LCS/79/TM-131, Massachusetts Institute of Technology, Laboratory for Computer Science, March 1979.
3. E. Allender. Invertible Functions. PhD thesis, Georgia Institute of Technology, 1985.
4. E. Allender. Some consequences of the existence of pseudorandom generators. In Proc. 19th ACM Symposium on Theory of Computation, pages 151–159, 1987.
5. E.A. Allender and R.S. Rubinstein. P-printable sets. SIAM J. on Computing, 17, 1988.