33
Publications
889
Citations
19
H-Index
1987
Active since
Steffen Lempp is an author at University of Wisconsin–Madison specializing in discrete mathematics, computer science, and computational complexity.
Top concepts
Discrete MathematicsEngineeringComputational ComplexityComputer ScienceAutomated ReasoningFormal MethodsProof ComplexityPhysicsLinguisticsGraph Theory
Publications per year
1987–2019
33
33
The d.r.e. degrees are not dense
S. Barry Cooper, Leo Harrington, A. H. Lachlan et al. · Annals of Pure and Applied Logic · 1991 · 75 citations
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
Uri Andrews, Steffen Lempp, Joseph S. Miller et al. · Journal of Symbolic Logic · 2014 · 61 citations
The complexity of computable categoricity
Rodney G. Downey, Asher M. Kach, Steffen Lempp et al. · Advances in Mathematics · 2014 · 56 citations
Rows per page
1–5 of 33