1. Ambos-Spies, K.: On the strongly bounded Turing degrees of the computably enumerable sets (to appear)
2. Ambos-Spies, K.: Uniformly bounded Turing reducibilities (to appear)
3. Ambos-Spies, K., Bodewig, P., Kräling, T., Yu, L.: Joins and meets in the computably enumerable cl-degrees (to appear)
4. Ambos-Spies, K., Ding, D., Fan, Y., Merkle, W.: Maximal pairs of computably enumerable sets in the computable Lipschitz degrees. Theor. Comput. Syst. 52(1), 2–27 (2013)
5. Lecture Notes in Computer Science;G Barmpalias,2005