×

zbMATH — the first resource for mathematics

Ambos-Spies, Klaus

Compute Distance To:
Author ID: ambos-spies.klaus Recent zbMATH articles by "Ambos-Spies, Klaus"
Published as: Ambos-Spies, K.; Ambos-Spies, Klaus
Documents Indexed: 98 Publications since 1981, including 9 Books

Publications by Year

Citations contained in zbMATH

77 Publications have been cited 475 times in 280 Documents Cited by Year
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Zbl 0539.03020
Ambos-Spies, Klaus; Jockusch, Carl G. jun.; Shore, Richard A.; Soare, Robert I.
36
1984
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
25
2004
Resource-bounded measure and randomness. Zbl 0877.68055
Ambos-Spies, Klaus; Mayordomo, Elvira
22
1997
Weakly computable real numbers. Zbl 0974.03054
Ambos-Spies, Klaus; Weihrauch, Klaus; Zheng, Xizhong
18
2000
Diagonalizations over polynomial time computable sets. Zbl 0653.03028
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
18
1987
Resource bounded randomness and weakly complete problems. Zbl 0912.68069
Ambos-Spies, Klaus; Terwijn, Sebastiaan A.; Zheng, Xizhong
16
1997
Lattice embeddings into the recursively enumerable degrees. Zbl 0633.03037
Ambos-Spies, K.; Lerman, M.
15
1986
Sublattices of the polynomial time degrees. Zbl 0556.03033
Ambos-Spies, Klaus
14
1985
Lattice embeddings into the recursively enumerable degrees. II. Zbl 0687.03022
Ambos-Spies, K.; Lerman, M.
13
1989
Degree theoretical splitting properties of recursively enumerable sets. Zbl 0673.03027
Ambos-Spies, Klaus; Fejer, Peter A.
13
1988
Randomness in computability theory. Zbl 0962.03039
Ambos-Spies, Klaus; Kučera, Antonín
12
2000
Genericity and measure for exponential time. Zbl 0874.68094
Ambos-Spies, Klaus; Neis, Hans-Christian; Terwijn, Sebastiaan A.
12
1996
The recursively enumerable degrees have infinitely many one-types. Zbl 0682.03024
Ambos-Spies, Klaus; Soare, Robert I.
12
1989
Randomness, relativizations, and polynomial reducibilities. Zbl 0615.03024
Ambos-Spies, Klaus
12
1986
Undecidability and 1-types in the recursively enumerable degrees. Zbl 0788.03062
Ambos-Spies, Klaus; Shore, Richard A.
11
1993
Minimal pairs for polynomial time reducibilities. Zbl 0637.03038
Ambos-Spies, Klaus
11
1987
On the structure of polynomial time degrees. Zbl 0546.03021
Ambos-Spies, Klaus
10
1984
Separating NP-completeness notions under strong hypotheses. Zbl 0971.68064
Ambos-Spies, Klaus; Bentzien, Levke
9
2000
Resource-bounded balanced genericity, stochasticity and weak randomness. Zbl 1379.68185
Ambos-Spies, Klaus; Mayordomo, Elvira; Wang, Yongge; Zheng, Xizhong
9
1996
Resource-bounded genericity. Zbl 0844.03022
Ambos-Spies, Klaus
9
1996
The theory of the recursively enumerable weak truth-table degrees is undecidable. Zbl 0776.03020
Ambos-Spies, Klaus; Nies, André; Shore, Richard A.
9
1992
Anti-mitotic recursively enumerable sets. Zbl 0587.03029
Ambos-Spies, Klaus
9
1985
P-mitotic sets. Zbl 0546.03020
Ambos-Spies, Klaus
9
1984
Diagonalizing over deterministic polynomial time. Zbl 0684.68045
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
8
1988
Cupping and noncapping in the r.e. weak truth table and Turing degrees. Zbl 0619.03032
Ambos-Spies, Klaus
8
1985
Bounding non-\(\mathrm{GL}_2\) and r.e.a. Zbl 1201.03025
Ambos-Spies, Klaus; Ding, Decheng; Wang, Wei; Yu, Liang
7
2009
Resource bounded randomness and weakly complete problems. Zbl 0953.68546
Ambos-Spies, Klaus; Terwijn, Sebastiaan A.; Zheng, Xizhong
7
1994
On pairs of recursively enumerable degrees. Zbl 0541.03023
Ambos-Spies, Klaus
7
1984
Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989. Zbl 0699.00011
Ambos-Spies, Klaus (ed.); Müller, Gert (ed.); Sacks, Gerald E. (ed.)
6
1990
Initial segments of recursive linear orders. Zbl 0909.03034
Ambos-Spies, Klaus; Cooper, S. Barry; Lempp, Steffen
5
1998
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
The continuity of cupping to \(\text \textbf{0}'\). Zbl 0805.03030
Ambos-Spies, Klaus; Lachlan, Alistair H.; Soare, Robert I.
5
1993
On the relative complexity of hard problems for complexity classes without complete problems. Zbl 0659.03022
Ambos-Spies, Klaus
5
1989
Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets. Zbl 0592.03028
Ambos-Spies, Klaus
5
1986
An extension of the nondiamond theorem in classical and \(\alpha\)- recursion theory. Zbl 0577.03022
Ambos-Spies, Klaus
5
1984
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees. Zbl 1273.03140
Ambos-Spies, Klaus; Ding, Decheng; Fan, Yun; Merkle, Wolfgang
4
2013
Some methods used in the research of structural polynomial complexity. Zbl 0837.68037
Ambos-Spies, K.; Yang, Dongping
4
1995
Honest polynomial time reducibilities and the \(P=?NP\) problem. Zbl 0694.68027
Ambos-Spies, Klaus
4
1989
A note on complete problems for complexity classes. Zbl 0634.68036
Ambos-Spies, Klaus
4
1986
P-generic sets. Zbl 0556.03032
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
4
1984
On the structure of the recursively enumerable degrees. (Dissertation). Zbl 0484.03023
Ambos-Spies, Klaus
4
1981
Weak completeness notions for exponential time. Zbl 1288.68077
Ambos-Spies, Klaus; Bakibayev, Timur
3
2010
Embeddings of \(N_5\) and the contiguous degrees. Zbl 1003.03038
Ambos-Spies, Klaus; Fejer, Peter A.
3
2001
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
Honest polynomial-time degrees of elementary recursive sets. Zbl 0925.03197
Ambos-Spies, Klaus; Yang, Dong Ping
3
1990
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. Zbl 1275.03132
Ambos-Spies, Klaus; Bodewig, Philipp; Fan, Yun; Kräling, Thorsten
2
2013
Comparing nontriviality for E and EXP. Zbl 1253.68137
Ambos-Spies, Klaus; Bakibayev, Timur
2
2012
Inductive inference and computable numberings. Zbl 1221.03035
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
2
2011
Automatic forcing and genericity: On the diagonalization strength of finite automata. Zbl 1038.03046
Ambos-Spies, Klaus; Busse, Edgar
2
2003
Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets. Zbl 0912.03023
Ambos-Spies, Klaus; Lempp, Steffen; Mainhardt, Gunther
2
1998
Discontinuity of cappings in the recursively enumerable degrees and strongly nonbranching degrees. Zbl 0813.03027
Ambos-Spies, Klaus; Ding, Decheng
2
1994
Embedding distributive lattices preserving 1 below a nonzero recursively enumerable Turing degree. Zbl 0819.03031
Ambos-Spies, Klaus; Ding, Decheng; Fejer, Peter A.
2
1993
Cappable recursively enumerable degrees and Post’s program. Zbl 0791.03020
Ambos-Spies, Klaus; Nies, André
2
1992
On the relative complexity of subproblems of intractable problems. Zbl 0577.03020
Ambos-Spies, Klaus
2
1985
Contiguous r. e. degrees. Zbl 0562.03022
Ambos-Spies, Klaus
2
1984
On the strongly bounded Turing degrees of the computably enumerable sets. Zbl 06700080
Ambos-Spies, Klaus
1
2017
Degrees of unsolvability. Zbl 1404.03004
Ambos-Spies, Klaus; Fejer, Peter A.
1
2014
On the strongly bounded Turing degrees of simple sets. Zbl 1328.03044
Ambos-Spies, Klaus
1
2014
Nontriviality for exponential time w.r.t. weak reducibilities. Zbl 1294.68082
Ambos-Spies, Klaus; Bakibayev, Timur
1
2013
Quantitative aspects of speed-up and gap phenomena. Zbl 1226.03050
Ambos-Spies, Klaus; Kräling, Thorsten
1
2010
Nontriviality for exponential time w.r.t. weak reducibilities. Zbl 1284.68272
Ambos-Spies, Klaus; Bakibayev, Timur
1
2010
Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Zbl 1192.68004
Ambos-Spies, Klaus (ed.); Löwe, Benedikt (ed.); Merkle, Wolfgang (ed.)
1
2009
On a question of Frank Stephan. Zbl 1140.03313
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
1
2008
Computational aspects of disjunctive sequences. Zbl 1097.03033
Ambos-Spies, Klaus; Busse, Edgar
1
2004
Problems which cannot be reduced to any proper subproblems. Zbl 1124.03323
Ambos-Spies, Klaus
1
2003
Almost complete sets. Zbl 1048.03032
Ambos-Spies, Klaus; Merkle, Wolfgang; Reimann, Jan; Terwijn, Sebastiaan A.
1
2003
Measure theoretic completeness notions for the exponential time classes. Zbl 0996.68062
Ambos-Spies, Klaus
1
2000
Undecidability and 1-types in intervals of the computably enumerable degrees. Zbl 0971.03040
Ambos-Spies, Klaus; Hirschfeldt, Denis R.; Shore, Richard A.
1
2000
Polynomial time reducibilities and degrees. Zbl 0941.03043
Ambos-Spies, Klaus
1
1999
Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27–February 3, 1996. Zbl 0922.00014
Ambos-Spies, Klaus (ed.); Slaman, Theodore A. (ed.); Soare, Robert I. (ed.)
1
1998
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
Minimal pairs and complete problems. Zbl 0801.03031
Ambos-Spies, Klaus; Homer, Steven; Soare, Robert I.
1
1994
Honest polynomial reductions and Exptally sets. Zbl 0722.03034
Ambos-Spies, Klaus; Homer, Steven; Yang, Dongping
1
1990
Minimal pairs and complete problems. Zbl 0744.03045
Ambos-Spies, Klaus; Homer, Steven; Soare, Robert I.
1
1990
On disjunctive self-reducibility. Zbl 0716.03037
Ambos-Spies, Klaus; Kämper, Jürgen
1
1989
An inhomogeneity in the structure of Karp degrees. Zbl 0618.03018
Ambos-Spies, Klaus
1
1986
An extension of the non-diamond theorem in classical and \(\alpha\)- recursion theory. Zbl 0533.03026
Ambos-Spies, Klaus
1
1982
On the strongly bounded Turing degrees of the computably enumerable sets. Zbl 06700080
Ambos-Spies, Klaus
1
2017
Degrees of unsolvability. Zbl 1404.03004
Ambos-Spies, Klaus; Fejer, Peter A.
1
2014
On the strongly bounded Turing degrees of simple sets. Zbl 1328.03044
Ambos-Spies, Klaus
1
2014
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees. Zbl 1273.03140
Ambos-Spies, Klaus; Ding, Decheng; Fan, Yun; Merkle, Wolfgang
4
2013
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. Zbl 1275.03132
Ambos-Spies, Klaus; Bodewig, Philipp; Fan, Yun; Kräling, Thorsten
2
2013
Nontriviality for exponential time w.r.t. weak reducibilities. Zbl 1294.68082
Ambos-Spies, Klaus; Bakibayev, Timur
1
2013
Comparing nontriviality for E and EXP. Zbl 1253.68137
Ambos-Spies, Klaus; Bakibayev, Timur
2
2012
Inductive inference and computable numberings. Zbl 1221.03035
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
2
2011
Weak completeness notions for exponential time. Zbl 1288.68077
Ambos-Spies, Klaus; Bakibayev, Timur
3
2010
Quantitative aspects of speed-up and gap phenomena. Zbl 1226.03050
Ambos-Spies, Klaus; Kräling, Thorsten
1
2010
Nontriviality for exponential time w.r.t. weak reducibilities. Zbl 1284.68272
Ambos-Spies, Klaus; Bakibayev, Timur
1
2010
Bounding non-\(\mathrm{GL}_2\) and r.e.a. Zbl 1201.03025
Ambos-Spies, Klaus; Ding, Decheng; Wang, Wei; Yu, Liang
7
2009
Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Zbl 1192.68004
Ambos-Spies, Klaus (ed.); Löwe, Benedikt (ed.); Merkle, Wolfgang (ed.)
1
2009
On a question of Frank Stephan. Zbl 1140.03313
Ambos-Spies, Klaus; Badaev, Serikzhan; Goncharov, Sergey
1
2008
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
25
2004
Computational aspects of disjunctive sequences. Zbl 1097.03033
Ambos-Spies, Klaus; Busse, Edgar
1
2004
Automatic forcing and genericity: On the diagonalization strength of finite automata. Zbl 1038.03046
Ambos-Spies, Klaus; Busse, Edgar
2
2003
Problems which cannot be reduced to any proper subproblems. Zbl 1124.03323
Ambos-Spies, Klaus
1
2003
Almost complete sets. Zbl 1048.03032
Ambos-Spies, Klaus; Merkle, Wolfgang; Reimann, Jan; Terwijn, Sebastiaan A.
1
2003
Embeddings of \(N_5\) and the contiguous degrees. Zbl 1003.03038
Ambos-Spies, Klaus; Fejer, Peter A.
3
2001
Weakly computable real numbers. Zbl 0974.03054
Ambos-Spies, Klaus; Weihrauch, Klaus; Zheng, Xizhong
18
2000
Randomness in computability theory. Zbl 0962.03039
Ambos-Spies, Klaus; Kučera, Antonín
12
2000
Separating NP-completeness notions under strong hypotheses. Zbl 0971.68064
Ambos-Spies, Klaus; Bentzien, Levke
9
2000
Measure theoretic completeness notions for the exponential time classes. Zbl 0996.68062
Ambos-Spies, Klaus
1
2000
Undecidability and 1-types in intervals of the computably enumerable degrees. Zbl 0971.03040
Ambos-Spies, Klaus; Hirschfeldt, Denis R.; Shore, Richard A.
1
2000
Polynomial time reducibilities and degrees. Zbl 0941.03043
Ambos-Spies, Klaus
1
1999
Initial segments of recursive linear orders. Zbl 0909.03034
Ambos-Spies, Klaus; Cooper, S. Barry; Lempp, Steffen
5
1998
Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets. Zbl 0912.03023
Ambos-Spies, Klaus; Lempp, Steffen; Mainhardt, Gunther
2
1998
Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27–February 3, 1996. Zbl 0922.00014
Ambos-Spies, Klaus (ed.); Slaman, Theodore A. (ed.); Soare, Robert I. (ed.)
1
1998
Resource-bounded measure and randomness. Zbl 0877.68055
Ambos-Spies, Klaus; Mayordomo, Elvira
22
1997
Resource bounded randomness and weakly complete problems. Zbl 0912.68069
Ambos-Spies, Klaus; Terwijn, Sebastiaan A.; Zheng, Xizhong
16
1997
Genericity and measure for exponential time. Zbl 0874.68094
Ambos-Spies, Klaus; Neis, Hans-Christian; Terwijn, Sebastiaan A.
12
1996
Resource-bounded balanced genericity, stochasticity and weak randomness. Zbl 1379.68185
Ambos-Spies, Klaus; Mayordomo, Elvira; Wang, Yongge; Zheng, Xizhong
9
1996
Resource-bounded genericity. Zbl 0844.03022
Ambos-Spies, Klaus
9
1996
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
Some methods used in the research of structural polynomial complexity. Zbl 0837.68037
Ambos-Spies, K.; Yang, Dongping
4
1995
Resource bounded randomness and weakly complete problems. Zbl 0953.68546
Ambos-Spies, Klaus; Terwijn, Sebastiaan A.; Zheng, Xizhong
7
1994
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
Discontinuity of cappings in the recursively enumerable degrees and strongly nonbranching degrees. Zbl 0813.03027
Ambos-Spies, Klaus; Ding, Decheng
2
1994
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
Minimal pairs and complete problems. Zbl 0801.03031
Ambos-Spies, Klaus; Homer, Steven; Soare, Robert I.
1
1994
Undecidability and 1-types in the recursively enumerable degrees. Zbl 0788.03062
Ambos-Spies, Klaus; Shore, Richard A.
11
1993
The continuity of cupping to \(\text \textbf{0}'\). Zbl 0805.03030
Ambos-Spies, Klaus; Lachlan, Alistair H.; Soare, Robert I.
5
1993
Embedding distributive lattices preserving 1 below a nonzero recursively enumerable Turing degree. Zbl 0819.03031
Ambos-Spies, Klaus; Ding, Decheng; Fejer, Peter A.
2
1993
The theory of the recursively enumerable weak truth-table degrees is undecidable. Zbl 0776.03020
Ambos-Spies, Klaus; Nies, André; Shore, Richard A.
9
1992
Cappable recursively enumerable degrees and Post’s program. Zbl 0791.03020
Ambos-Spies, Klaus; Nies, André
2
1992
Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989. Zbl 0699.00011
Ambos-Spies, Klaus (ed.); Müller, Gert (ed.); Sacks, Gerald E. (ed.)
6
1990
Honest polynomial-time degrees of elementary recursive sets. Zbl 0925.03197
Ambos-Spies, Klaus; Yang, Dong Ping
3
1990
Honest polynomial reductions and Exptally sets. Zbl 0722.03034
Ambos-Spies, Klaus; Homer, Steven; Yang, Dongping
1
1990
Minimal pairs and complete problems. Zbl 0744.03045
Ambos-Spies, Klaus; Homer, Steven; Soare, Robert I.
1
1990
Lattice embeddings into the recursively enumerable degrees. II. Zbl 0687.03022
Ambos-Spies, K.; Lerman, M.
13
1989
The recursively enumerable degrees have infinitely many one-types. Zbl 0682.03024
Ambos-Spies, Klaus; Soare, Robert I.
12
1989
On the relative complexity of hard problems for complexity classes without complete problems. Zbl 0659.03022
Ambos-Spies, Klaus
5
1989
Honest polynomial time reducibilities and the \(P=?NP\) problem. Zbl 0694.68027
Ambos-Spies, Klaus
4
1989
On disjunctive self-reducibility. Zbl 0716.03037
Ambos-Spies, Klaus; Kämper, Jürgen
1
1989
Degree theoretical splitting properties of recursively enumerable sets. Zbl 0673.03027
Ambos-Spies, Klaus; Fejer, Peter A.
13
1988
Diagonalizing over deterministic polynomial time. Zbl 0684.68045
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
8
1988
Diagonalizations over polynomial time computable sets. Zbl 0653.03028
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
18
1987
Minimal pairs for polynomial time reducibilities. Zbl 0637.03038
Ambos-Spies, Klaus
11
1987
Lattice embeddings into the recursively enumerable degrees. Zbl 0633.03037
Ambos-Spies, K.; Lerman, M.
15
1986
Randomness, relativizations, and polynomial reducibilities. Zbl 0615.03024
Ambos-Spies, Klaus
12
1986
Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets. Zbl 0592.03028
Ambos-Spies, Klaus
5
1986
A note on complete problems for complexity classes. Zbl 0634.68036
Ambos-Spies, Klaus
4
1986
An inhomogeneity in the structure of Karp degrees. Zbl 0618.03018
Ambos-Spies, Klaus
1
1986
Sublattices of the polynomial time degrees. Zbl 0556.03033
Ambos-Spies, Klaus
14
1985
Anti-mitotic recursively enumerable sets. Zbl 0587.03029
Ambos-Spies, Klaus
9
1985
Cupping and noncapping in the r.e. weak truth table and Turing degrees. Zbl 0619.03032
Ambos-Spies, Klaus
8
1985
On the relative complexity of subproblems of intractable problems. Zbl 0577.03020
Ambos-Spies, Klaus
2
1985
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Zbl 0539.03020
Ambos-Spies, Klaus; Jockusch, Carl G. jun.; Shore, Richard A.; Soare, Robert I.
36
1984
On the structure of polynomial time degrees. Zbl 0546.03021
Ambos-Spies, Klaus
10
1984
P-mitotic sets. Zbl 0546.03020
Ambos-Spies, Klaus
9
1984
On pairs of recursively enumerable degrees. Zbl 0541.03023
Ambos-Spies, Klaus
7
1984
An extension of the nondiamond theorem in classical and \(\alpha\)- recursion theory. Zbl 0577.03022
Ambos-Spies, Klaus
5
1984
P-generic sets. Zbl 0556.03032
Ambos-Spies, Klaus; Fleischhack, Hans; Huwig, Hagen
4
1984
Contiguous r. e. degrees. Zbl 0562.03022
Ambos-Spies, Klaus
2
1984
An extension of the non-diamond theorem in classical and \(\alpha\)- recursion theory. Zbl 0533.03026
Ambos-Spies, Klaus
1
1982
On the structure of the recursively enumerable degrees. (Dissertation). Zbl 0484.03023
Ambos-Spies, Klaus
4
1981
all top 5

Cited by 239 Authors

32 Downey, Rodney Graham
26 Ambos-Spies, Klaus
18 Nies, André Otfrid
14 Lempp, Steffen
14 Shore, Richard A.
11 Zheng, Xizhong
10 Hitchcock, John M.
9 Barmpalias, George
9 Slaman, Theodore A.
9 Stephan, Frank
8 Merkle, Wolfgang
7 Glaßer, Christian
7 Pavan, Aduri
7 Wu, Guohua
6 Ding, Decheng
6 Greenberg, Noam
6 Lerman, Manuel
6 Lutz, Jack H.
6 Selman, Alan L.
6 Simpson, Stephen G.
6 Suzuki, Toshio
5 Li, Angsheng
5 Mayordomo, Elvira
5 Soare, Robert I.
4 Cai, Mingzhong
4 Fenner, Stephen A.
4 Jockusch, Carl G. jun.
4 Kjos-Hanssen, Bjørn
4 Lewis-Pye, Andrew E. M.
4 Miller, Joseph S.
4 Rettinger, Robert
4 Stob, Michael
4 Wang, Wei
3 Bakibayev, Timur
3 Book, Ronald Vernon
3 Buhrman, Harry
3 Cooper, Stuart Barry
3 Fortnow, Lance J.
3 Griffiths, Evan J.
3 Gu, Xiaoyang
3 Hirschfeldt, Denis Roman
3 Khoussainov, Bakhadyr M.
3 Liu, Jiang
3 Shinoda, Juichi
3 Sui, Yuefei
3 Terwijn, Sebastiaan A.
3 Yang, Yue
2 Beros, Achilles A.
2 Bienvenu, Laurent
2 Borchert, Bernd
2 Brattka, Vasco
2 Chong, Chi Tat
2 Dai, Jack Jie
2 Dzhafarov, Damir D.
2 Englert, Burkhard
2 Fejer, Peter A.
2 Figueira, Santiago
2 Gasarch, William Ian
2 Harrington, Leo A.
2 Hemaspaandra, Lane A.
2 Homer, Steven
2 Hudelson, W. M. Phillip
2 Jain, Sanjay
2 Juedes, David W.
2 Khan, Mushfeq
2 Kumabe, Masahiro
2 LaForte, Geoffrey L.
2 Li, Weilin
2 Ogihara, Mitsunori
2 Omanadze, Roland Sh.
2 Patey, Ludovic
2 Regan, Kenneth W.
2 Reimann, Jan
2 Remmel, Jeffrey B.
2 Schwarz, Steven Thomas
2 Silvestri, Riccardo
2 Sorbi, Andrea
2 Torenvliet, Leen
2 Travers, Stephen D.
2 Turetsky, Dan
2 Vinodchandran, N. Variyam
2 Wang, Yongge
2 Weber, Rebecca
2 Witek, Maximilian
2 Yamakami, Tomoyuki
2 Yu, Liang
2 Zhang, Liyu
1 Amir, Amihood
1 Anderson, Bernard A.
1 Andrews, Uri
1 Aoki, Kunimasa
1 Arslanov, Marat M.
1 Artemov, Sergei
1 Badaev, Serikzhan A.
1 Bao, Kejin
1 Becher, Verónica
1 Bikmukhametov, R. I.
1 Binns, Stephen
1 Blaylock, Rich
1 Böhler, Elmar
...and 139 more Authors

Citations by Year