1. Mytilinaios, Michael E. and Slaman, Theodore A. (2003). Differences between resource bounded degree structures. Notre Dame J. Formal Logic 44 No.1, 1--12. [pdf] [GS][MRef]
2. Haught, Christine Ann and Slaman, Theodore A. (1997). Automorphisms in the PTIME-Turing degrees of recursive sets. Ann. Pure Appl. Logic 84 No.1, 139--152. Fifth Asian Logic Conference (Singapore, 1993). [MR] [GS][MRef]
3. Maass, Wolfgang and Slaman, Theodore A. (1992). Splitting and density for the recursive sets of a fixed time complexity. In Logic from computer science (Berkeley, CA, 1989) Math. Sci. Res. Inst. Publ. 21 359--372 Springer New York. [MR] [GS][MRef]
4. Maass, Wolfgang and Slaman, Theodore A. (1992). The complexity types of computable sets. J. Comput. System Sci. 44 No.2, 168--192. [MR] [GS][MRef]
5. Shore, Richard A. and Slaman, Theodore A. (1992). The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory. Theoret. Comput. Sci. 97 No.2, 263--284. [MR] [GS][MRef]
6. Maass, Wolfgang and Slaman, Theodore A. (1990). On the relationship between the complexity, the degree, and the extension of a computable set. In Recursion theory week (Oberwolfach, 1989) Lecture Notes in Math. 1432 297--322 Springer Berlin. [MR] [GS][MRef]
7. Shinoda, Juichi and Slaman, Theodore A. (1990). On the theory of the PTIME degrees of the recursive sets. J. Comput. System Sci. 41 No.3, 321--366. [MR] [GS][MRef]
8. Maass, W. and Slaman, Theodore A. (1989). The Complexity Types of Computable Sets. In Annual Conference on Structure in Complexity Theory. [GS][MRef]
9. Maass, Wolfgang and Slaman, Theodore A. (1989). Some problems and results in the theory of actually computable functions (preliminary abstract). In Logic Colloquium '88 (Padova, 1988) Stud. Logic Found. Math. 127 79--89 North-Holland Amsterdam. [MR] [GS][MRef]
10. Maass, Wolfgang and Slaman, Theodore A. (1989). Extensional properties of sets of time bounded complexity (extended abstract). In Fundamentals of computation theory (Szeged, 1989) Lecture Notes in Comput. Sci. 380 318--326 Springer New York. [MR] [GS][MRef]
11. Shore, Richard A. and Slaman, Theodore A. (1989). The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two Quantifier Theory (Extended Abstract). In Annual Conference on Structure in Complexity Theory. [GS][MRef]
12. Shinoda, Juichi and Slaman, Theodore A. (1988). On the Theory of the PTIME Degrees of the Recursive Sets. In Annual Conference on Structure in Complexity Theory. [GS][MRef]