1. Ambos-Spies, K.: Resource-bounded genericity. In: Cooper, S., Slaman, T., Wainer, S. (eds.) Computability, enumerability, unsolvability. Directions in recursion theory, pp. 1–60. Cambridge University Press, Cambridge (1996)
2. Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, pp. 1–47. Dekker, New York (1997)
3. Ambos-Spies, K., Reimann, J.: Effective Baire category concepts. In: Proc. Sixth Asian Logic Conference 1996, pp. 13–29. Singapore University Press (1997)
4. Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM 14(2), 322–336 (1967)
5. Borodin, A.: Computational complexity and the existence of complexity gaps. Journal of the ACM 19(1), 158–174 (1972)