Klaus Ambos-Spies

	2012
63		Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe: Computability in Europe 2009. Ann. Pure Appl. Logic 163(5): 483-484 (2012)
62		Klaus Ambos-Spies, Timur Bakibayev: Comparing Nontriviality for E and EXP. Theory Comput. Syst. 51(1): 106-122 (2012)
	2011
61		Klaus Ambos-Spies, Serikzhan Badaev, Sergey S. Goncharov: Inductive inference and computable numberings. Theor. Comput. Sci. 412(18): 1652-1668 (2011)
	2010
60		Klaus Ambos-Spies, Timur Bakibayev: Weak Completeness Notions for Exponential Time. ICALP (1) 2010: 503-514
59		Klaus Ambos-Spies, Timur Bakibayev: Nontriviality for Exponential Time w.r.t. Weak Reducibilities. TAMC 2010: 84-93
58		Klaus Ambos-Spies, Thorsten Kräling: Quantitative aspects of speed-up and gap phenomena. Mathematical Structures in Computer Science 20(5): 707-722 (2010)
	2009
57		Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings Springer 2009
56		Klaus Ambos-Spies, Thorsten Kräling: Quantitative Aspects of Speed-Up and Gap Phenomena. TAMC 2009: 88-97
55		Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu: Bounding non-GL2 and R.E.A. J. Symb. Log. 74(3): 989-1000 (2009)
	2008
54		Klaus Ambos-Spies, Serikzhan Badaev, Sergey Goncharov: On a Question of Frank Stephan. TAMC 2008: 423-432
	2004
53		Klaus Ambos-Spies, Edgar Busse: Computational Aspects of Disjunctive Sequences. MFCS 2004: 711-722
52		Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman: Comparing DNR and WWKL. J. Symb. Log. 69(4): 1089-1104 (2004)
	2003
51		Klaus Ambos-Spies, Edgar Busse: Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. DMTCS 2003: 97-108
50		Klaus Ambos-Spies: Problems with Cannot Be Reduced to Any Proper Subproblems. MFCS 2003: 162-168
49		Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost complete sets. Theor. Comput. Sci. 306(1-3): 177-194 (2003)
	2001
48		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		Klaus Ambos-Spies: Measure Theoretic Completeness Notions for the Exponential Time Classes. MFCS 2000: 152-161
45		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		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		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		Klaus Ambos-Spies, Levke Bentzien: Separating NP-Completeness Notions under Strong Hypotheses. IEEE Conference on Computational Complexity 1997: 121-127
39		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		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		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

Coauthor Index

1	Serikzhan Badaev	[54] [61]
2	Timur Bakibayev	[59] [60] [62]
3	Arnold Beckmann	[63]
4	Levke Bentzien	[40] [42]
5	Samuel R. Buss	[63]
6	Edgar Busse	[51] [53]
7	Decheng Ding	[30] [55]
8	Peter A. Fejer	[16] [36] [47]
9	Hans Fleischhack	[13] [15]
10	Sergey Goncharov (Sergey S. Goncharov)	[54] [61]
11	Denis R. Hirschfeldt	[44]
12	Steven Homer	[23] [28] [29]
13	Hagen Huwig	[13] [15]
14	Jürgen Kämper	[17]
15	Bjørn Kjos-Hanssen	[52]
16	Thorsten Kräling	[56] [58]
17	Alistair H. Lachlan	[26]
18	Steffen Lempp	[36] [41] [52]
19	Manuel Lerman	[9] [19] [36]
20	Benedikt Löwe	[57] [63]
21	Gunther Mainhardt	[41]
22	Elvira Mayordomo	[37] [38]
23	Wolfgang Merkle	[45] [48] [49] [57]
24	Hans-Christian Neis	[31] [35]
25	André Nies	[24] [25]
26	Jan Reimann	[45] [48] [49]
27	Uwe Schöning	[28]
28	Richard A. Shore	[24] [27] [44]
29	Theodore A. Slaman	[52]
30	Robert I. Soare	[21] [23] [26] [29]
31	Frank Stephan	[48]
32	Sebastiaan Terwijn (Sebastiaan A. Terwijn)	[31] [32] [35] [39] [45] [49]
33	Wei Wang	[55]
34	Yongge Wang	[37]
35	Klaus Weihrauch	[43]
36	Dongping Yang	[22]
37	Liang Yu	[55]
38	Xizhong Zheng	[32] [37] [38] [39] [43]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page