P-mitotic sets. - Klaus Ambos-Spies (Logic and Machines, 1983)

P-Generic Sets. - Klaus Ambos-Spies (ICALP, 1984)

On the Structure of Polynomial Time Degrees. - Klaus Ambos-Spies (STACS, 1984)

An Extension of the Nondiamond Theorem in Classical and alpha-Recursion Theory. - Klaus Ambos-Spies (J. Symb. Log., 1984)

On the structure of the polynomial time degrees of recursive sets. - Klaus Ambos-Spies (1985)

Three Theorems on Polynomial Degrees of NP-Sets - Klaus Ambos-Spies (FOCS, 1985)

On the Relative Complexity of Subproblems of Intractable Problems. - Klaus Ambos-Spies (STACS, 1985)

Cupping and noncapping in the r.e. weak truth table and turing degrees. - Klaus Ambos-Spies (Arch. Math. Log., 1985)

Anti-Mitotic Recursively Enumerable Sets. - Klaus Ambos-Spies (Math. Log. Q., 1985)

Sublattices of the Polynomial Time Degrees - Klaus Ambos-Spies (Inf. Control., 1985)

Randomness, Relativizations, and Polynomial Reducibilities. - Klaus Ambos-Spies (SCT, 1986)

Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. - Klaus Ambos-Spies (Inf. Process. Lett., 1986)

A Note on the Complete Problems for Complexity Classes. - Klaus Ambos-Spies (Inf. Process. Lett., 1986)

Lattice Embeddings into the Recursively Enumerable Degrees. - Klaus Ambos-Spies; Manuel Lerman (J. Symb. Log., 1986)

An Inhomogeneity in the Structure of Karp Degrees. - Klaus Ambos-Spies (SIAM J. Comput., 1986)

Minimal Pairs for Polynomial Time Reducibilities. - Klaus Ambos-Spies (Computation Theory and Logic, 1987)

Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. - Klaus Ambos-Spies (SCT, 1987)

Diagonalizing over Deterministic Polynomial Time. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (CSL, 1987)

Diagonalizations over Polynomial Time Computable Sets. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (Theor. Comput. Sci., 1987)

On Disjunctive Self-Reducibility. - Klaus Ambos-Spies; Jürgen Kämper (CSL, 1988)

Degree Theoretical Splitting Properties of Recursively Enumerable Sets. - Klaus Ambos-Spies; Peter A. Fejer (J. Symb. Log., 1988)

Honest Polynomial-Time Degrees of Elementary Recursive Sets. - Klaus Ambos-Spies; Dongping Yang (CSL, 1989)

The Recursively Enumerable Degrees have Infinitely Many One-Types. - Klaus Ambos-Spies; Robert I. Soare (Ann. Pure Appl. Log., 1989)

Honest Polynomial Time Reducibilities and the P = ? NP Problem. - Klaus Ambos-Spies (J. Comput. Syst. Sci., 1989)

Lattice Embeddings into the Recursively Enumerable Degrees II. - Klaus Ambos-Spies; Manuel Lerman (J. Symb. Log., 1989)

On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. - Klaus Ambos-Spies (Theor. Comput. Sci., 1989)

Minimal Pairs and Complete Problems. - Klaus Ambos-Spies; Steven Homer; Robert I. Soare (STACS, 1990)

The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. - Klaus Ambos-Spies; André Nies (STACS, 1992)

Cappable recursively enumerable degrees and Post's program. - Klaus Ambos-Spies; André Nies (Arch. Math. Log., 1992)

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. - Klaus Ambos-Spies; André Nies; Richard A. Shore (J. Symb. Log., 1992)

The Continuity of Cupping to 0'. - Klaus Ambos-Spies; Alistair H. Lachlan; Robert I. Soare (Ann. Pure Appl. Log., 1993)

Undecidability and 1-Types in the Recursively Enumerable Degrees. - Klaus Ambos-Spies; Richard A. Shore (Ann. Pure Appl. Log., 1993)

Resource Bounded Randomness and Weakly Complete Problems. - Klaus Ambos-Spies; Sebastiaan Terwijn; Xizhong Zheng (ISAAC, 1994)

Genericity and Measure for Exponential Time. - Klaus Ambos-Spies; Hans-Christian Neis; Sebastiaan Terwijn (MFCS, 1994)

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. - Decheng Ding; Klaus Ambos-Spies (Math. Log. Q., 1994)

Resource-Bounded Genericity. - Klaus Ambos-Spies (SCT, 1995)

On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). - Klaus Ambos-Spies (ICALP, 1995)

A Comparison of Weak Completeness Notions. - Klaus Ambos-Spies; Elvira Mayordomo; Xizhong Zheng (CCC, 1996)

Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. - Klaus Ambos-Spies; Elvira Mayordomo; Yongge Wang 001; Xizhong Zheng (STACS, 1996)

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. - Klaus Ambos-Spies; Peter A. Fejer; Steffen Lempp; Manuel Lerman (J. Symb. Log., 1996)

Separating NP-Completeness Notions under Strong Hypotheses. - Klaus Ambos-Spies; Levke Bentzien (CCC, 1997)

Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. - Klaus Ambos-Spies; Steffen Lempp; Gunther Mainhardt (MFCS, 1998)

Polynomial Time Reducibilities and Degrees. - Klaus Ambos-Spies (Handbook of Computability Theory, 1999)

Measure Theoretic Completeness Notions for the Exponential Time Classes. - Klaus Ambos-Spies (MFCS, 2000)

Almost Complete Sets. - Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann 001; Sebastiaan Terwijn (STACS, 2000)

Undecidability and 1-types in intervals of the computably enumerable degrees. - Klaus Ambos-Spies; Denis R. Hirschfeldt; Richard A. Shore (Ann. Pure Appl. Log., 2000)

Weakly Computable Real Numbers. - Klaus Ambos-Spies; Klaus Weihrauch; Xizhong Zheng (J. Complex., 2000)

Hausdorff Dimension in Exponential Time. - Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann 001; Frank Stephan 001 (CCC, 2001)

Embedding of N5 and the contiguous degrees. - Klaus Ambos-Spies; Peter A. Fejer (Ann. Pure Appl. Log., 2001)

Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. - Klaus Ambos-Spies; Edgar Busse (DMTCS, 2003)

Problems with Cannot Be Reduced to Any Proper Subproblems. - Klaus Ambos-Spies (MFCS, 2003)

Computational Aspects of Disjunctive Sequences. - Klaus Ambos-Spies; Edgar Busse (MFCS, 2004)

Comparing DNR and WWKL. - Klaus Ambos-Spies; Bjørn Kjos-Hanssen; Steffen Lempp; Theodore A. Slaman (J. Symb. Log., 2004)

On a Question of Frank Stephan. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey Goncharov 002 (TAMC, 2008)

Quantitative Aspects of Speed-Up and Gap Phenomena. - Klaus Ambos-Spies; Thorsten Kräling (TAMC, 2009)

Bounding non-GL2 and R.E.A. - Klaus Ambos-Spies; Decheng Ding; Wei Wang 345; Liang Yu 004 (J. Symb. Log., 2009)

Weak Completeness Notions for Exponential Time. - Klaus Ambos-Spies; Timur Bakibayev (ICALP (1), 2010)

Nontriviality for Exponential Time w.r.t. Weak Reducibilities. - Klaus Ambos-Spies; Timur Bakibayev (TAMC, 2010)

Inductive inference and computable numberings. - Klaus Ambos-Spies; Serikzhan A. Badaev; Sergey S. Goncharov (Theor. Comput. Sci., 2011)

Computability in Europe 2009. - Klaus Ambos-Spies; Arnold Beckmann; Samuel R. Buss; Benedikt Löwe (Ann. Pure Appl. Log., 2012)

Comparing Nontriviality for E and EXP. - Klaus Ambos-Spies; Timur Bakibayev (Theory Comput. Syst., 2012)

Real Benefit of Promises and Advice. - Klaus Ambos-Spies; Ulrike Brandt; Martin Ziegler 001 (CiE, 2013)

Preface. - Klaus Ambos-Spies; Joan Bagaria; Enrique Casanovas; Ulrich Kohlenbach (Ann. Pure Appl. Log., 2013)

The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. - Klaus Ambos-Spies; Philipp Bodewig; Yun Fan; Thorsten Kräling (Ann. Pure Appl. Log., 2013)

Computability in Europe 2009. - Klaus Ambos-Spies; Arnold Beckmann; Erzsébet Csuhaj-Varjú; Benedikt Löwe (J. Log. Comput., 2013)

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. - Klaus Ambos-Spies; Decheng Ding; Yun Fan; Wolfgang Merkle (Theory Comput. Syst., 2013)

On the strongly bounded turing degrees of simple sets. - Klaus Ambos-Spies (Logic, Computation, Hierarchies, 2014)

Degrees of Unsolvability. - Klaus Ambos-Spies; Peter A. Fejer (Computational Logic, 2014)

Learning Finite Variants of Single Languages from Informant. - Klaus Ambos-Spies (ALT, 2016)

On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. - Klaus Ambos-Spies (Computability and Complexity, 2017)

Computability Theory (Dagstuhl Seminar 17081). - Klaus Ambos-Spies; Vasco Brattka; Rodney G. Downey; Steffen Lempp (Dagstuhl Reports, 2017)

Multiple Permitting and Array Noncomputability. - Klaus Ambos-Spies (CiE, 2018)

Automorphism bases for the recursively enumerable degrees. - Klaus Ambos-Spies (Comput., 2018)

On the Differences and Sums of Strongly Computably Enumerable Real Numbers. - Klaus Ambos-Spies; Xizhong Zheng (CiE, 2019)

Some Observations on Mitotic Sets. - Klaus Ambos-Spies (Logic, Computation and Rigorous Methods, 2021)

On Supersets of non-low 22_2 Sets. - Klaus Ambos-Spies; Rodney G. Downey; Martin Monath (J. Symb. Log., 2021)

Normalized information distance and the oscillation hierarchy. - Klaus Ambos-Spies; Wolfgang Merkle; Sebastiaan A. Terwijn (J. Comput. Syst. Sci., 2022)

Lowness properties for strong reducibilities and the computational power of maximal sets. - Klaus Ambos-Spies; Rod Downey; Martin Monath (Comput., 2024)