1. Amir, A., Beigel, R., Gasarch, W.: Some connections between bounded query classes and non-uniform complexity. In: Proc. 5th Struct. in Complexity Th. (1990)
2. Amir, A., Gasarch, W.: Polynomial terse sets. Inf. and Computation 77 (1988)
3. Bab, S.: Reduktionsbeziehungen zwischen Teilinformationsklassen bei beschränkter Fragenzahl. Master’s thesis, Technical University Berlin, Germany (2003)
4. Bab, S., Nickelsen, A.: Reducibilities between polynomial time partial information classes over 2-families. Technical Report 2004/07, TU Berlin (2004)
5. Beigel, R.: Query-Limited Reducibilities. PhD thesis, Stanford University (1987)