1. Ambos-Spies, K.: Randomness relativizations, and polynomial reducibilities. Structure in complexity theory (Berkeley, Calif., 1986), 23–34, Lecture Notes in Comput Sci., vol. 223. Springer, Berlin (1986)
2. Ambos-Spies, K.: Minimal pairs for polynomial time reducibilities. Computation theory and logic, 1–13, Lecture Notes in Comput Sci., vol. 270. Springer, Berlin (1987)
3. Ambos-Spies, K.: Honest polynomial time reducibilities and the P =? NP problem. J. Comput. Syst. Sci. 39(3), 250–281 (1989)
4. Ambos-Spies, K.: Resource-bounded genericity. Computability, enumerability, unsolvability, 1–59, London Math. Soc. Lecture Note Ser., vol. 224. Cambridge Univ. Press, Cambridge (1996)
5. Ambos-Spies, K.: Polynomial time reducibilities and degrees. Handbook of computability theory, 683–705, Stud. Logic Found. Math., 140, North-Holland, Amsterdam (1999)