1. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234–250, 1992.
2. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193–1202, 1988.
3. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory. Cambridge University Press. To appear.
4. V. Arvind, U. Schöning, and R. Schuler. On helping probabilistic oracle machines. Draft, Mar. 1993.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3–40, 1991.