1. Abrahamson, K., R. Downey and M. Fellows, Fixed Parameter Tractability and Completeness IV: W[P] and PSPACE. To appear.
2. Abrahamson, K., R. Downey and M. Fellows, Fixed Parameter Intractability II. To appear in STACS’ 93.
3. Ambos-Spies, K., S. Homer and R. Soare [1990], Minimal pairs and complete problems. Proc. STACS’90, Lecture Notes in Computer Science, 415, Springer-Verlag, 24–36.
4. Ambos-Spies, K. [1984], On the structure of polynomial time degrees. STACS 84, Lecture Notes in Computer Science, 166, Springer-Verlag, 198–208.
5. Ambos-Spies, K. [1985], On the structure of the polynomial time degrees of recursive sets. Technical report 206, Abteilung Informatik, Universität Dortmund.