Klaus Ambos‐Spies - Concepedia

Author

Klaus Ambos‐Spies

Also Known As

Allender, Eric, Ambos-Spies, K., Ambos-Spies, Klaus, K. Ambos-Spies, KLAUS AMBOS-SPIES, Klaus Ambos-Spies, Klaus Ambos-spies, Klaus Ambos‐Spies, Klaus Ambos–Spies

136

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

TU Dortmund University Heidelberg University University of Chicago Cornell University Nanjing University

About

Klaus Ambos‐Spies is an author at TU Dortmund University specializing in engineering, discrete mathematics, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	11	14	378
2	Computer Science	9	9	251
3	Combinatorial Optimization	4	4	110
4	Mathematical Foundations	2	2	45
5	Complexity	1	1	11

Klaus Ambos‐Spies

Publications

739

Citations

H-Index

Page 1

	Year	Citations
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees Klaus Ambos‐Spies, Carl G. Jockusch, Richard A. Shore, Transactions of the American Mathematical Society	1984	98
Resource bounded randomness and weakly complete problems Klaus Ambos‐Spies, Sebastiaan A. Terwijn, Zheng Xizhong Theoretical Computer Science EngineeringEntropyIntegrable ProbabilityRandomized AlgorithmProbability Theory	1997	68
Weakly Computable Real Numbers Klaus Ambos‐Spies, Klaus Weihrauch, Xizhong Zheng Journal of Complexity Real Data TypeComputer ScienceComputational Model TheoryComputability Theory	2000	67
Genericity and measure for exponential time Klaus Ambos‐Spies, Hans-Christian Neis, Sebastiaan A. Terwijn Theoretical Computer Science Measure TheoryEngineeringEntropyProbability TheoryPoisson Boundary	1996	58
Diagonalizations over polynomial time computable sets Klaus Ambos‐Spies, Hans Fleischhack, Hagen Huwig Theoretical Computer Science Computational Complexity TheoryEngineeringComputational ComplexityTime ComplexityComputer Science	1987	51
Sublattices of the polynomial time degrees Klaus Ambos‐Spies Information and Control Real Algebraic GeometryAlgebraic CombinatoricsUniversal AlgebraPolynomial Time Degrees	1985	33
Lattice embeddings into the recursively enumerable degrees Klaus Ambos‐Spies, Manuel Lerman Journal of Symbolic Logic Four-element Boolean AlgebraEngineeringSubstructural LogicLattice (Order)Finite Lattices	1986	28
Hausdorff dimension in exponential time Klaus Ambos‐Spies, Wolfgang Merkle, Jan Reimann, Measure TheoryEngineeringEntropyIntegrable ProbabilityAlgorithmic Information Theory	2002	26
A note on complete problems for complexity classes Klaus Ambos‐Spies Information Processing Letters EngineeringComplexity ClassesAbstract ComplexityComputational ComplexityTime Complexity	1986	25
On pairs of recursively enumerable degrees Klaus Ambos‐Spies Transactions of the American Mathematical Society Nonzero Incomplete R.eExtremal Set TheoryAlgebraic CombinatoricsEnumerable DegreesDiscrete Mathematics	1984	24

Page 1