1. Time and tape complexity of pushdown automaton languages;Aho;Inform. and Control,1968
2. The polynomial time hierarchy and sparse oracles;Balcázar;J. Assoc. Comput. Mach.,1986
3. Structural Complexity I;Balcázar,1988
4. J. L. Balcázar and U. Schöning, “Logarithmic Advice Classes,” Report de recerca LSI-88-12, Univ. Politècnica de Catalunya, J. Theoret. Comp. Sci., to appear.
5. Relationship between density and deterministic complexity of NP-complete languages;Berman,1978