Abstract
When I was asked to contribute to a volume dedicated to Thomas Ottmann’s sixtieth birthday, I immediately agreed. I have known Thomas for more than 25 years, I like him, and I admire his work and his abilities as a cyclist. Of course, when it came to start writing, I started to have second thoughts.What should I write about? I could have taken one of my recent papers. But that seemed inappropriate; none of them is single authored. It had to be more personal.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn, and E. Schömer. A computational basis for conic arcs and boolean operations on conic polygons. to appear in ESA 2002, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/ConicPolygons.ps, 2002.
C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. A separation bound for real algebraic expressions. In ESA 2001, Lecture Notes in Computer Science, pages 254–265, 2001. http://www.mpisb.mpg.de/~mehlhorn/ftp/ImprovedSepBounds.ps.gz.
M. Blum and S. Kannan. Designing programs that check their work. In Proceedings of the 21th Annual ACM Symposium on Theory of Computing (STOC’89), pages 86–97, 1989.
M. Blum and H. Wasserman. Reflections on the pentium division bug. IEEE Transaction on Computing, 45(4):385–393, 1996.
W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. John Wiley & Sons, Inc, 1998.
N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30(1):54–76, 1985.
M. Dhiflaoui, S. Funke, C. Kwappik, K. Mehlhorn, M. Seel, E. Schömer, R. Schulte, and D. Weber. Certifying and repairing solutions to large LPs, How good are LP-solvers? to appear in SODA 2003, http://www.mpisb.mpg.de/~mehlhorn/ftp/LPExactShort.ps, 2002.
J. E. Hopcroft and R. E. Tarjan. Efficient planarity testing. Journal of the ACM, 21:549–568, 1974.
J. Keyser, T. Culver, M. Foskey, S. Krishnan, and D. Manocha. ESOLID: A system for exact boundary evaluation. In 7th ACM Symposium on Solid Modelling and Applications, pages 23–34, 2002.
V. Karamcheti, C. Li, I. Pechtchanski, and Chee Yap. A core library for robust numeric and geometric computation. In Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pages 351–359, Miami, Florida, 1999.
D. Kratsch, R. McConnell, K. Mehlhorn, and J. P. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003 to appear, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/intervalgraph.ps, 2002.
A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Theory of Graphs, International Symposium, Rome, pages 215–232, 1967.
K. Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
K. Mehlhorn, S. Näher, T. Schilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. In Proceedings of the 12th Annual Symposium on Computational Geometry (SCG’96), pages 159–165, 1996.
T. Ottmann, G. Thiemt, and C. Ullrich. Numerical stability of geometric algorithms. In Derick Wood, editor, Proceedings of the 3rd Annual Symposium on Computational Geometry (SCG’ 87), pages 119–125, Waterloo, ON, Canada, June 1987. ACM Press.
T. Ottmann and P. Widmayer.Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, 1996.
G. F. Sullivan and G. M. Masson. Using certification trails to achieve software fault tolerance. In Brian Randell, editor, Proceedings of the 20th Annual International Symposium on Fault-Tolerant Computing (FTCS’ 90), pages 423–433. IEEE, 1990.
Brian T. Smith. Error bounds for zeros of a polynomial based upon Gerschgorin’s theorems. Journal of the ACM, 17(4):661–674, October 1970.
Joachim Von zur Gathen and Jürgen Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 1999. Chapters 1 and 21 cover cryptography and public key cryptography.
H. Wasserman and M. Blum. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826–849, 1997.
C. K. Yap. Fundamental Problems in Algorithmic Algebra. Oxford University Press, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mehlhorn, K. (2003). The Reliable Algorithmic Software Challenge RASC Dedicated to Thomas Ottmann on the Occasion of His 60th Birthday. In: Klein, R., Six, HW., Wegner, L. (eds) Computer Science in Perspective. Lecture Notes in Computer Science, vol 2598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36477-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-36477-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00579-7
Online ISBN: 978-3-540-36477-1
eBook Packages: Springer Book Archive