Klaus Ambos-Spies

ORCID

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 12

Top Venues

CiE

Comput.

J. Comput. Syst. Sci.

ALT

University of Dortmund, Germany (PHD)

Education History

University of Dortmund, Germany

PHD

Publications

Klaus Ambos-Spies, Rod Downey, Martin Monath
Lowness properties for strong reducibilities and the computational power of maximal sets. Comput. 13 (1) (2024)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized information distance and the oscillation hierarchy. J. Comput. Syst. Sci. 124 (2022)
Klaus Ambos-Spies, Rodney G. Downey, Martin Monath
On Supersets of non-low 22_2 Sets. J. Symb. Log. 86 (3) (2021)
Klaus Ambos-Spies
Some Observations on Mitotic Sets. Logic, Computation and Rigorous Methods (2021)
Klaus Ambos-Spies, Xizhong Zheng
On the Differences and Sums of Strongly Computably Enumerable Real Numbers. CiE (2019)
Klaus Ambos-Spies, Timur Bakibayev
Weak Completeness Notions for Exponential Time. Theory Comput. Syst. 63 (6) (2019)
Klaus Ambos-Spies
Automorphism bases for the recursively enumerable degrees. Comput. 7 (2-3) (2018)
Klaus Ambos-Spies
Multiple Permitting and Array Noncomputability. CiE (2018)
Klaus Ambos-Spies
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. Computability and Complexity (2017)
Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7 (2) (2017)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized Information Distance and the Oscillation Hierarchy. CoRR (2017)
Klaus Ambos-Spies
Learning Finite Variants of Single Languages from Informant. ALT (2016)
Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. Theory Comput. Syst. 52 (1) (2013)
Klaus Ambos-Spies, Arnold Beckmann, Erzsébet Csuhaj-Varjú, Benedikt Löwe
Computability in Europe 2009. J. Log. Comput. 23 (4) (2013)
Klaus Ambos-Spies, Ulrike Brandt, Martin Ziegler
Real Benefit of Promises and Advice. CiE (2013)
Klaus Ambos-Spies, Timur Bakibayev
Nontriviality for exponential time w.r.t. weak reducibilities. Theor. Comput. Sci. 494 (2013)
Klaus Ambos-Spies, Philipp Bodewig, Yun Fan, Thorsten Kräling
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. Ann. Pure Appl. Log. 164 (5) (2013)
Klaus Ambos-Spies, Joan Bagaria, Enrique Casanovas, Ulrich Kohlenbach
Preface. Ann. Pure Appl. Log. 164 (12) (2013)
Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe
Computability in Europe 2009. Ann. Pure Appl. Log. 163 (5) (2012)
Klaus Ambos-Spies, Timur Bakibayev
Comparing Nontriviality for E and EXP. Theory Comput. Syst. 51 (1) (2012)
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov
Inductive inference and computable numberings. Theor. Comput. Sci. 412 (18) (2011)
Klaus Ambos-Spies, Timur Bakibayev
Weak Completeness Notions for Exponential Time. ICALP (1) (2010)
Klaus Ambos-Spies, Thorsten Kräling
Quantitative aspects of speed-up and gap phenomena. Math. Struct. Comput. Sci. 20 (5) (2010)
Klaus Ambos-Spies, Timur Bakibayev
Nontriviality for Exponential Time w.r.t. Weak Reducibilities. TAMC (2010)
Klaus Ambos-Spies, Thorsten Kräling
Quantitative Aspects of Speed-Up and Gap Phenomena. TAMC (2009)
Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu
and R.E.A. J. Symb. Log. 74 (3) (2009)
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov
On a Question of Frank Stephan. TAMC (2008)
Klaus Ambos-Spies, Edgar Busse
Computational Aspects of Disjunctive Sequences. MFCS (2004)
Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
Comparing DNR and WWKL. J. Symb. Log. 69 (4) (2004)
Klaus Ambos-Spies, Edgar Busse
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. DMTCS (2003)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
Almost complete sets. Theor. Comput. Sci. 306 (1-3) (2003)
Klaus Ambos-Spies
Problems with Cannot Be Reduced to Any Proper Subproblems. MFCS (2003)
Klaus Ambos-Spies, Peter A. Fejer
and the contiguous degrees. Ann. Pure Appl. Log. 112 (2-3) (2001)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
Hausdorff Dimension in Exponential Time. Computational Complexity Conference (2001)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
Almost Complete Sets. STACS (2000)
Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore
Undecidability and 1-types in intervals of the computably enumerable degrees. Ann. Pure Appl. Log. 106 (1-3) (2000)
Klaus Ambos-Spies
Measure Theoretic Completeness Notions for the Exponential Time Classes. MFCS (2000)
Klaus Ambos-Spies, Levke Bentzien
Separating NP-Completeness Notions under Strong Hypotheses. J. Comput. Syst. Sci. 61 (3) (2000)
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
Weakly Computable Real Numbers. J. Complex. 16 (4) (2000)
Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS (1998)
Klaus Ambos-Spies, Levke Bentzien
Separating NP-Completeness Notions under Strong Hypotheses. Computational Complexity Conference (1997)
Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng
Resource Bounded Randomness and Weakly Complete Problems. Theor. Comput. Sci. 172 (1-2) (1997)
Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn
Genericity and Measure for Exponential Time. Theor. Comput. Sci. 168 (1) (1996)
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. J. Symb. Log. 61 (3) (1996)
Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng
A Comparison of Weak Completeness Notions. Computational Complexity Conference (1996)
Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. STACS (1996)
Klaus Ambos-Spies
Resource-Bounded Genericity. Computational Complexity Conference (1995)
Klaus Ambos-Spies
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). ICALP (1995)
Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn
Genericity and Measure for Exponential Time. MFCS (1994)
Klaus Ambos-Spies, Steven Homer, Robert I. Soare
Minimal Pairs and Complete Problems. Theor. Comput. Sci. 132 (2) (1994)
Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng
Resource Bounded Randomness and Weakly Complete Problems. ISAAC (1994)
Decheng Ding, Klaus Ambos-Spies
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. Math. Log. Q. 40 (1994)
Klaus Ambos-Spies, Richard A. Shore
Undecidability and 1-Types in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 63 (1) (1993)
Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare
The Continuity of Cupping to 0'. Ann. Pure Appl. Log. 64 (3) (1993)
Klaus Ambos-Spies, André Nies, Richard A. Shore
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. J. Symb. Log. 57 (3) (1992)
Klaus Ambos-Spies, André Nies
Cappable recursively enumerable degrees and Post's program. Arch. Math. Log. 32 (1) (1992)
Klaus Ambos-Spies, André Nies
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. STACS (1992)
Klaus Ambos-Spies, Steven Homer, Robert I. Soare
Minimal Pairs and Complete Problems. STACS (1990)
Klaus Ambos-Spies
Honest Polynomial Time Reducibilities and the P = ? NP Problem. J. Comput. Syst. Sci. 39 (3) (1989)
Klaus Ambos-Spies, Dongping Yang
Honest Polynomial-Time Degrees of Elementary Recursive Sets. CSL (1989)
Klaus Ambos-Spies, Manuel Lerman
Lattice Embeddings into the Recursively Enumerable Degrees II. J. Symb. Log. 54 (3) (1989)
Klaus Ambos-Spies
On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. Theor. Comput. Sci. 63 (1) (1989)
Klaus Ambos-Spies, Robert I. Soare
The Recursively Enumerable Degrees have Infinitely Many One-Types. Ann. Pure Appl. Log. 44 (1-2) (1989)
Klaus Ambos-Spies, Peter A. Fejer
Degree Theoretical Splitting Properties of Recursively Enumerable Sets. J. Symb. Log. 53 (4) (1988)
Klaus Ambos-Spies, Jürgen Kämper
On Disjunctive Self-Reducibility. CSL (1988)
Klaus Ambos-Spies
Minimal Pairs for Polynomial Time Reducibilities. Computation Theory and Logic (1987)
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
Diagonalizing over Deterministic Polynomial Time. CSL (1987)
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
Diagonalizations over Polynomial Time Computable Sets. Theor. Comput. Sci. 51 (1987)
Klaus Ambos-Spies
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. Computational Complexity Conference (1987)
Klaus Ambos-Spies, Manuel Lerman
Lattice Embeddings into the Recursively Enumerable Degrees. J. Symb. Log. 51 (2) (1986)
Klaus Ambos-Spies
A Note on the Complete Problems for Complexity Classes. Inf. Process. Lett. 23 (5) (1986)
Klaus Ambos-Spies
Randomness, Relativizations, and Polynomial Reducibilities. Computational Complexity Conference (1986)
Klaus Ambos-Spies
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. Inf. Process. Lett. 22 (3) (1986)
Klaus Ambos-Spies
An Inhomogeneity in the Structure of Karp Degrees. SIAM J. Comput. 15 (4) (1986)
Klaus Ambos-Spies
Cupping and noncapping in the r.e. weak truth table and turing degrees. Arch. Math. Log. 25 (1) (1985)
Klaus Ambos-Spies
Anti-Mitotic Recursively Enumerable Sets. Math. Log. Q. 31 (29-30) (1985)
Klaus Ambos-Spies
Three Theorems on Polynomial Degrees of NP-Sets FOCS (1985)
Klaus Ambos-Spies
Sublattices of the Polynomial Time Degrees Inf. Control. 65 (1) (1985)
Klaus Ambos-Spies
On the Relative Complexity of Subproblems of Intractable Problems. STACS (1985)
Klaus Ambos-Spies
An Extension of the Nondiamond Theorem in Classical and alpha-Recursion Theory. J. Symb. Log. 49 (2) (1984)
Klaus Ambos-Spies
P-Generic Sets. ICALP (1984)
Klaus Ambos-Spies
On the Structure of Polynomial Time Degrees. STACS (1984)
Klaus Ambos-Spies
P-mitotic sets. Logic and Machines (1983)

Klaus Ambos-Spies.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus Ambos-Spies