| 2008 |
|---|
| 53 | EE | Klaus Ambos-Spies,
Serikzhan Badaev,
Sergey Goncharov:
On a Question of Frank Stephan.
TAMC 2008: 423-432 |
| 2004 |
|---|
| 52 | EE | Klaus Ambos-Spies,
Edgar Busse:
Computational Aspects of Disjunctive Sequences.
MFCS 2004: 711-722 |
| 2003 |
|---|
| 51 | EE | Klaus Ambos-Spies,
Edgar Busse:
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata.
DMTCS 2003: 97-108 |
| 50 | EE | Klaus Ambos-Spies:
Problems with Cannot Be Reduced to Any Proper Subproblems.
MFCS 2003: 162-168 |
| 49 | EE | Klaus Ambos-Spies,
Wolfgang Merkle,
Jan Reimann,
Sebastiaan Terwijn:
Almost complete sets.
Theor. Comput. Sci. 306(1-3): 177-194 (2003) |
| 2001 |
|---|
| 48 | EE | Klaus Ambos-Spies,
Wolfgang Merkle,
Jan Reimann,
Frank Stephan:
Hausdorff Dimension in Exponential Time.
IEEE Conference on Computational Complexity 2001: 210-217 |
| 47 | | Klaus Ambos-Spies,
Peter A. Fejer:
Embedding of N5 and the contiguous degrees.
Ann. Pure Appl. Logic 112(2-3): 151-188 (2001) |
| 2000 |
|---|
| 46 | EE | Klaus Ambos-Spies:
Measure Theoretic Completeness Notions for the Exponential Time Classes.
MFCS 2000: 152-161 |
| 45 | EE | Klaus Ambos-Spies,
Wolfgang Merkle,
Jan Reimann,
Sebastiaan Terwijn:
Almost Complete Sets.
STACS 2000: 419-430 |
| 44 | | Klaus Ambos-Spies,
Denis R. Hirschfeldt,
Richard A. Shore:
Undecidability and 1-types in intervals of the computably enumerable degrees.
Ann. Pure Appl. Logic 106(1-3): 1-47 (2000) |
| 43 | EE | Klaus Ambos-Spies,
Klaus Weihrauch,
Xizhong Zheng:
Weakly Computable Real Numbers.
J. Complexity 16(4): 676-690 (2000) |
| 42 | | Klaus Ambos-Spies,
Levke Bentzien:
Separating NP-Completeness Notions under Strong Hypotheses.
J. Comput. Syst. Sci. 61(3): 335-361 (2000) |
| 1998 |
|---|
| 41 | EE | Klaus Ambos-Spies,
Steffen Lempp,
Gunther Mainhardt:
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets.
MFCS 1998: 465-473 |
| 1997 |
|---|
| 40 | EE | Klaus Ambos-Spies,
Levke Bentzien:
Separating NP-Completeness Notions under Strong Hypotheses.
IEEE Conference on Computational Complexity 1997: 121-127 |
| 39 | EE | Klaus Ambos-Spies,
Sebastiaan Terwijn,
Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems.
Theor. Comput. Sci. 172(1-2): 195-207 (1997) |
| 1996 |
|---|
| 38 | EE | Klaus Ambos-Spies,
Elvira Mayordomo,
Xizhong Zheng:
A Comparison of Weak Completeness Notions.
IEEE Conference on Computational Complexity 1996: 171-178 |
| 37 | | Klaus Ambos-Spies,
Elvira Mayordomo,
Yongge Wang,
Xizhong Zheng:
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness.
STACS 1996: 63-74 |
| 36 | | 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): 880-905 (1996) |
| 35 | EE | Klaus Ambos-Spies,
Hans-Christian Neis,
Sebastiaan Terwijn:
Genericity and Measure for Exponential Time.
Theor. Comput. Sci. 168(1): 3-19 (1996) |
| 1995 |
|---|
| 34 | | Klaus Ambos-Spies:
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract).
ICALP 1995: 384-392 |
| 33 | | Klaus Ambos-Spies:
Resource-Bounded Genericity.
Structure in Complexity Theory Conference 1995: 162-181 |
| 1994 |
|---|
| 32 | | Klaus Ambos-Spies,
Sebastiaan Terwijn,
Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems.
ISAAC 1994: 369-377 |
| 31 | | Klaus Ambos-Spies,
Hans-Christian Neis,
Sebastiaan Terwijn:
Genericity and Measure for Exponential Time.
MFCS 1994: 221-232 |
| 30 | | Decheng Ding,
Klaus Ambos-Spies:
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.
Math. Log. Q. 40: 287-317 (1994) |
| 29 | | Klaus Ambos-Spies,
Steven Homer,
Robert I. Soare:
Minimal Pairs and Complete Problems.
Theor. Comput. Sci. 132(2): 229-241 (1994) |
| 1993 |
|---|
| 28 | | Klaus Ambos-Spies,
Steven Homer,
Uwe Schöning:
Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992
Cambridge University Press 1993 |
| 27 | | Klaus Ambos-Spies,
Richard A. Shore:
Undecidability and 1-Types in the Recursively Enumerable Degrees.
Ann. Pure Appl. Logic 63(1): 3-37 (1993) |
| 26 | | Klaus Ambos-Spies,
Alistair H. Lachlan,
Robert I. Soare:
The Continuity of Cupping to 0'.
Ann. Pure Appl. Logic 64(3): 195-209 (1993) |
| 1992 |
|---|
| 25 | | Klaus Ambos-Spies,
André Nies:
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable.
STACS 1992: 209-218 |
| 24 | | 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): 864-874 (1992) |
| 1990 |
|---|
| 23 | | Klaus Ambos-Spies,
Steven Homer,
Robert I. Soare:
Minimal Pairs and Complete Problems.
STACS 1990: 24-36 |
| 1989 |
|---|
| 22 | | Klaus Ambos-Spies,
Dongping Yang:
Honest Polynomial-Time Degrees of Elementary Recursive Sets.
CSL 1989: 1-15 |
| 21 | | Klaus Ambos-Spies,
Robert I. Soare:
The Recursively Enumerable Degrees have Infinitely Many One-Types.
Ann. Pure Appl. Logic 44(1-2): 1-23 (1989) |
| 20 | | Klaus Ambos-Spies:
Honest Polynomial Time Reducibilities and the P = ? NP Problem.
J. Comput. Syst. Sci. 39(3): 250-281 (1989) |
| 19 | | Klaus Ambos-Spies,
Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees II.
J. Symb. Log. 54(3): 735-760 (1989) |
| 18 | | Klaus Ambos-Spies:
On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems.
Theor. Comput. Sci. 63(1): 43-61 (1989) |
| 1988 |
|---|
| 17 | | Klaus Ambos-Spies,
Jürgen Kämper:
On Disjunctive Self-Reducibility.
CSL 1988: 1-13 |
| 16 | | Klaus Ambos-Spies,
Peter A. Fejer:
Degree Theoretical Splitting Properties of Recursively Enumerable Sets.
J. Symb. Log. 53(4): 1110-1137 (1988) |
| 1987 |
|---|
| 15 | | Klaus Ambos-Spies,
Hans Fleischhack,
Hagen Huwig:
Diagonalizing over Deterministic Polynomial Time.
CSL 1987: 1-16 |
| 14 | | Klaus Ambos-Spies:
Minimal Pairs for Polynomial Time Reducibilities.
Computation Theory and Logic 1987: 1-13 |
| 13 | | Klaus Ambos-Spies,
Hans Fleischhack,
Hagen Huwig:
Diagonalizations over Polynomial Time Computable Sets.
Theor. Comput. Sci. 51: 177-204 (1987) |
| 1986 |
|---|
| 12 | | Klaus Ambos-Spies:
Randomness, Relativizations, and Polynomial Reducibilities.
Structure in Complexity Theory Conference 1986: 23-34 |
| 11 | | Klaus Ambos-Spies:
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets.
Inf. Process. Lett. 22(3): 113-117 (1986) |
| 10 | | Klaus Ambos-Spies:
A Note on the Complete Problems for Complexity Classes.
Inf. Process. Lett. 23(5): 227-230 (1986) |
| 9 | | Klaus Ambos-Spies,
Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees.
J. Symb. Log. 51(2): 257-272 (1986) |
| 8 | | Klaus Ambos-Spies:
An Inhomogeneity in the Structure of Karp Degrees.
SIAM J. Comput. 15(4): 958-963 (1986) |
| 1985 |
|---|
| 7 | | Klaus Ambos-Spies:
Three Theorems on Polynomial Degrees of NP-Sets
FOCS 1985: 51-55 |
| 6 | | Klaus Ambos-Spies:
On the Relative Complexity of Subproblems of Intractable Problems.
STACS 1985: 1-12 |
| 5 | | Klaus Ambos-Spies:
Sublattices of the Polynomial Time Degrees
Information and Control 65(1): 63-84 (1985) |
| 1984 |
|---|
| 4 | | Klaus Ambos-Spies:
P-Generic Sets.
ICALP 1984: 58-68 |
| 3 | | Klaus Ambos-Spies:
On the Structure of Polynomial Time Degrees.
STACS 1984: 198-208 |
| 2 | | Klaus Ambos-Spies:
An Extension of the Nondiamond Theorem in Classical and alpha-Recursion Theory.
J. Symb. Log. 49(2): 586-607 (1984) |
| 1983 |
|---|
| 1 | | Klaus Ambos-Spies:
P-mitotic sets.
Logic and Machines 1983: 1-23 |
