| 2019 | CiE | On the Differences and Sums of Strongly Computably Enumerable Real Numbers. | Klaus Ambos-Spies, Xizhong Zheng |
| 2018 | CiE | Multiple Permitting and Array Noncomputability. | Klaus Ambos-Spies |
| 2016 | ALT | Learning Finite Variants of Single Languages from Informant. | Klaus Ambos-Spies |
| 2013 | CiE | Real Benefit of Promises and Advice. | Klaus Ambos-Spies, Ulrike Brandt, Martin Ziegler |
| 2010 | ICALP | Weak Completeness Notions for Exponential Time. | Klaus Ambos-Spies, Timur Bakibayev |
| 2010 | TAMC | Nontriviality for Exponential Time w.r.t. Weak Reducibilities. | Klaus Ambos-Spies, Timur Bakibayev |
| 2009 | TAMC | Quantitative Aspects of Speed-Up and Gap Phenomena. | Klaus Ambos-Spies, Thorsten Krling |
| 2008 | TAMC | On a Question of Frank Stephan. | Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov |
| 2004 | MFCS | Computational Aspects of Disjunctive Sequences. | Klaus Ambos-Spies, Edgar Busse |
| 2003 | MFCS | Problems with Cannot Be Reduced to Any Proper Subproblems. | Klaus Ambos-Spies |
| 2000 | MFCS | Measure Theoretic Completeness Notions for the Exponential Time Classes. | Klaus Ambos-Spies |
| 2000 | STACS | Almost Complete Sets. | Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn |
| 1998 | MFCS | Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. | Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt |
| 1996 | STACS | Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. | Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng |
| 1995 | ICALP | On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). | Klaus Ambos-Spies |
| 1994 | ISAAC | Resource Bounded Randomness and Weakly Complete Problems. | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
| 1994 | MFCS | Genericity and Measure for Exponential Time. | Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn |
| 1992 | STACS | The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. | Klaus Ambos-Spies, Andr Nies |
| 1990 | STACS | Minimal Pairs and Complete Problems. | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
| 1989 | CSL | Honest Polynomial-Time Degrees of Elementary Recursive Sets. | Klaus Ambos-Spies, Dongping Yang |
| 1988 | CSL | On Disjunctive Self-Reducibility. | Klaus Ambos-Spies, Jrgen Kmper |
| 1987 | CSL | Diagonalizing over Deterministic Polynomial Time. | Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig |
| 1985 | FOCS | Three Theorems on Polynomial Degrees of NP-Sets | Klaus Ambos-Spies |
| 1985 | STACS | On the Relative Complexity of Subproblems of Intractable Problems. | Klaus Ambos-Spies |
| 1984 | ICALP | P-Generic Sets. | Klaus Ambos-Spies |
| 1984 | STACS | On the Structure of Polynomial Time Degrees. | Klaus Ambos-Spies |