1. Some connections between bounded query classes and non-uniform complexity;Amir,1990
2. Polynomial terse sets;Amir;Inform. and Comput.,1988
3. S. Bab, Reduktionsbeziehungen zwischen Teilinformationsklassen bei beschränkter Fragenzahl, Master's Thesis, Technical University Berlin, Germany, 2003.
4. S. Bab, A. Nickelsen, One query reducibilities between partial information classes, in: Proc. MFCS 04, Springer Lecture Notes in Computer Science, vol. 3153, Springer, Berlin, 2004, pp. 404-415.
5. R. Beigel, Query-limited reducibilities, Ph.D. Thesis, Stanford University, 1987.