1. Mehlhorn, K.: Polynomial and abstract subrecursive classes. Journal of Computer and System Sciences, 148–176 (1976)
2. Mehlhorn, K., Näher, S.: LEDA — A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge (1999)
3. Mehlhorn, K.: Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer, Heidelberg (1984)
4. Burnikel, C., Fleischer, R., Mehlhorn, K., Schirra, S.: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA 1997) (1997)
5. Burnikel, F., Mehlhorn, S.: Efficient exact geometric computation made easy. In: Annual ACM Symposium on Computational Geometry, pp. 341–350 (1999)