The Reliable Algorithmic Software Challenge RASC Dedicated to Thomas Ottmann on the Occasion of His 60th Birthday

  • Kurt Mehlhorn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2598)


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.


Computational Geometry Permutation Graph Linear Programming Solver Posteriori Analysis Node Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BEH+02]
    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,, 2002.
  2. [BFM+01]
    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. Scholar
  3. [BK89]
    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.Google Scholar
  4. [BW96]
    M. Blum and H. Wasserman. Reflections on the pentium division bug. IEEE Transaction on Computing, 45(4):385–393, 1996.zbMATHCrossRefGoogle Scholar
  5. [CCPS98]
    W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. John Wiley & Sons, Inc, 1998.Google Scholar
  6. [CNAO85]
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [DFK+02]
    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,, 2002.
  8. [HT74]
    J. E. Hopcroft and R. E. Tarjan. Efficient planarity testing. Journal of the ACM, 21:549–568, 1974.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [KCF+02]
    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.Google Scholar
  10. [KLPY99]
    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.Google Scholar
  11. [KMMS02]
    D. Kratsch, R. McConnell, K. Mehlhorn, and J. P. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003 to appear,, 2002.
  12. [LEC67]
    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.Google Scholar
  13. [MN99]
    K. Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.Google Scholar
  14. [MNS+96]
    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.Google Scholar
  15. [OTU87]
    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.Google Scholar
  16. [OW96]
    T. Ottmann and P. Widmayer.Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, 1996.Google Scholar
  17. [SM90]
    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.Google Scholar
  18. [Smi70]
    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.zbMATHCrossRefGoogle Scholar
  19. [VG99]
    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.zbMATHGoogle Scholar
  20. [WB97]
    H. Wasserman and M. Blum. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826–849, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  21. [Yap99]
    C. K. Yap. Fundamental Problems in Algorithmic Algebra. Oxford University Press, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations