1. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy.Journal of the ACM, 39(1):234–250, 1992.
2. V. Arvind, Y. Han, L. Hemachandra, J. Köhler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. InComplexity Theory, Current Research, Cambridge University Press, Cambridge, 1993, pp. 1–45.
3. E. Allender, L. Hemachandra, M Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets.SIAM Journal on Computing, 21(3):529–539, 1992.
4. V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets.Proceedings of the 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 652, Springer-Verlag, Berlin, 1992, pp. 140–151.
5. V. Arvind, J. Köbler, and M. Mundhenk. Lowness and the complexity of sparse and tally descriptions.Proceedings of the Third International Symposium on Algorithm and Computation, Lecture Notes in Computer Science, Vol. 650, Springer-Verlag, Berlin, 1992, pp. 249–258.