Steffen Lempp - Concepedia

Author

Steffen Lempp

University of Wisconsin–Madison ORCID

Also Known As

Lempp, Steffen, S. Lempp, STEFFEN LEMPP, Steffen Lempp

144

Publications

1.3K

Citations

H-Index

Concepts

All Affiliations

University of Wisconsin–Madison Victoria University of Wellington University of Chicago University of Connecticut University of Wisconsin System

About

Steffen Lempp is an author at University of Wisconsin–Madison specializing in discrete mathematics, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	11	15	389
2	Computer Science	11	12	315
3	Linguistics	2	2	47
4	Language Studies	1	1	28
5	Computer Engineering	1	1	34

Steffen Lempp

Publications

889

Citations

H-Index

Page 1

	Year	Citations
The d.r.e. degrees are not dense S. Barry Cooper, Leo Harrington, A. H. Lachlan, Annals of Pure and Applied Logic Integral GeometryHigh-energy-density MatterPhysics	1991	75
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS Uri Andrews, Steffen Lempp, Joseph S. Miller, Journal of Symbolic Logic Equivalence RelationEngineeringUniversal CeersDomain TheoryAutomated Reasoning	2014	61
The complexity of computable categoricity Rodney G. Downey, Asher M. Kach, Steffen Lempp, Advances in Mathematics EngineeringAbstract ComplexityAutomated ReasoningComputational Model TheoryFormal Methods	2014	56
The computable dimension of ordered abelian groups Steffen Lempp, Reed Solomon Advances in Mathematics Representation TheoryComputable DimensionOrdered GroupNilpotent GroupUniversal Algebra	2003	55
Weak density and cupping in the d-r.e. degrees S. Barry Cooper, Steffen Lempp, P.S. Watson Israel Journal of Mathematics Critical PhenomenonStatistical Field TheoryPhysicsWeak Density	1989	48
Computable categoricity of trees of finite height Steffen Lempp, Charles McCoy, Russell Miller, Journal of Symbolic Logic Tree LanguageEngineeringAutomated ReasoningHigher Category TheoryCategorical Trees	2005	46
Subspaces of computable vector spaces Rodney G. Downey, Denis R. Hirschfeldt, Asher M. Kach, Journal of Algebra EngineeringComputational Model TheorySet-theoretic TopologyComputer ScienceFunctional Analysis	2007	40
Ideals in computable rings Rodney G. Downey, Steffen Lempp, Joseph R. Mileti Journal of Algebra EngineeringModern AlgebraRing TheoryCommutative AlgebraComputer Engineering	2007	34
A Δ<sub>2</sub><sup>0</sup> set with no infinite low subset in either it or its complement Rod Downey, Denis R. Hirschfeldt, Steffen Lempp, Journal of Symbolic Logic Infinite Low SubsetNonlow SetEffective ContentExtremal Set TheorySet-theoretic Topology	2001	32
Friedberg Numberings of Families of n-Computably Enumerable Sets Steffen Lempp, D. R. Solomon Algebra and Logic Combinatorial DesignEnumerative CombinatoricsDiscrete MathematicsFriedberg NumberingsComputability Theory	2002	31

Page 1