MPI-INF Logo
  • Home
  • MPI-INF D1 Publications, generated: 17:19, 1 April 2023

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 419 documents:

  1. A Framework for the Verification of Certifying Computations
    Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, and Christine Rizkallah
    . Note: A preliminary version appeared under the title ``Verification of Certifying Computations'' in CAV 2011, LCNS Vol 6806, pages 67 -- 82. The full paper is under review at the Journal of Automated Reasoning. It is available at \url{http://www.mpi-inf.mpg.de/\~mehlhorn/ftp/FrameworkCertifyingComputations.pd f}
  2. Certifying 3-Edge-Connectivity
    Kurt Mehlhorn, A. Neumann, and Jens M. Schmidt
    In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), Lübeck, 2013, 358-369
  3. Every DFS tree of a 3-connected graph contains a contractible edge
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Journal of Graph Theory 72 (1): 112-121, 2013
  4. From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
    Kurt Mehlhorn, Michael Sagraloff, and Pengming Wang
    arXiv abs/1301.4870, 2013. Note: A short version has been submitted to the International Symposium on Symbolic and Algebraic Computation (ISSAC)
  5. On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
    Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, and Fahimeh Ramezani
    In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), Hangzhou, China, 2013, 65-76
  6. The cost of address translation
    Tomasz Jurkiewicz and Kurt Mehlhorn
    In: Proceedings of the Meeting on Algorithm Engineering & Experiments, New Orleans, USA, 2013. Note: Invited for publication in the ACM Journal of Experimental Algorithmics (JEA).
  7. The Query Complexity of Finding a Hidden Permutation
    Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, and Kurt Mehlhorn
    In: Space-Efficient Data Structures, Streams, and Algorithms, 2013, 1-11
  8. A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
    Ran Duan and Kurt Mehlhorn
    arXiv abs/1212.0979v1: 1-8, 2012
  9. An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Algorithmica 62 (3): 754-766, 2012
  10. Certifying 3-Edge-Connectivity
    Kurt Mehlhorn, Adrian Neumann, and Jens M. Schmidt
    . Note: Manuscript

  11. Counting Arbitrary Subgraphs in Data Streams
    Daniel Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 598-609
  12. Online Graph Exploration: New Results on Old and New Algorithms
    Nicole Megow, Kurt Mehlhorn, and Pascal Schweitzer
    Theoretical Computer Science 463: 62-72, 2012
  13. Physarum Can Compute Shortest Paths
    Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma
    Journal of Theoretical Biology 309: 121-133, 2012
  14. Physarum Can Compute Shortest Paths
    Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma
    In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 233-240
  15. Remarks on Category-Based Routing in Social Networks
    Karl Bringmann, Kurt Mehlhorn, and Adrian Neumann


  16. The Query Complexity of Finding a Hidden Permutation
    Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen
    Electronic Colloquium on Computational Complexity (ECCC): Report Series 87 (Revision 1): 1-36, 2012
  17. A deterministic algorithm for isolating real roots of a real polynomial
    Kurt Mehlhorn and Michael Sagraloff
    Journal of Symbolic Computation 46 (1): 70-90, 2011
  18. A General Approach to the Analysis of Controlled Perturbation Algorithms
    Kurt Mehlhorn, Ralf Osbild, and Michael Sagraloff
    Computational Geometry 44 (9): 507-528, 2011
  19. Additive Spanners and (α, β)-Spanners
    Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie
    ACM Transactions on Algorithms 7 (1): 5:1-5:26, 2011
  20. Approximate Counting of Cycles in Streams
    Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun
    In: 19th Annual European Symposium on Algorithms (ESA-11), Saarbrücken, Germany, 2011, 677-688
  21. Certifying algorithms
    Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
    Computer Science Review 5 (2): 119-161, 2011
  22. Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
    George Christodoulou, Kurt Mehlhorn, and Evangelia Pyrga
    In: Algorithms - ESA 2011 : 19th Annual European Symposium, Saarbrücken, Germany, 2011, 119-130
  23. New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    Algorithmica 59 (4): 471-488, 2011
  24. Online Graph Exploration: New Results on Old and New Algorithms
    Nicole Megow, Kurt Mehlhorn, and Pascal Schweitzer
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 478-489
  25. Verification of Certifying Computations
    Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, and Christine Rizkallah
    In: Computer Aided Verification : 23rd International Conference, CAV 2011, Snowbird, USA, 2011, 67-82
  26. Weisfeiler-Lehman graph kernels
    Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M. Borgwardt
    Journal of Machine Learning Research 12: 2539-2561, 2011
  27. Arrangements on Parametric Surfaces I: General Framework and Infrastructure
    Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, and Ron Wein
    Mathematics in Computer Science 4 (1): 45-66, 2010
  28. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre
    Algorithmica 58 (1): 119-136, 2010
  29. Certifying algorithms
    Ross M. McConnella, Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
    Computer Science Review Article in Press: 1-43, 2010
  30. Faster algorithms for computing Hong's bound on absolute positiveness
    Kurt Mehlhorn and Saurabh Ray
    Journal of Symbolic Computation 45 (6): 677-683, 2010
  31. Progress on Certifying Algorithms
    Kurt Mehlhorn and Pascal Schweitzer
    In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, Wuhan, China, 2010, 1-5
  32. Reliable and Efficient Geometric Computing
    Kurt Mehlhorn
    In: Mathematical Software, ICMS 2010 : Third International Congress on Mathematical Software, Kobe, Japan, 2010, 10-11
  33. An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Algorithmica Online First: 1-13, 2010
  34. A Separation Bound for Real Algebraic Expressions
    Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, and Susanne Schmitt
    Algorithmica 55 (1): 14-28, 2009
  35. Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
    Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, and Romeo Rizzi
    In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, Copenhagen, Denmark, 2009, 301-312
  36. Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
    Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, and Romeo Rizzi
    In: Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, 2009, 301-312
  37. Efficient Graphlet Kernels for Large Graph Comparison
    Nino Shervashidze, S .V. N. Vishwanathan, Tobias H. Petri, Kurt Mehlhorn, and Karsten M. Borgwardt
    In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), Clearwater Beach, Florida, USA, 2009, 488-495
    [PDF: Download: AISTATS09.pdf]
  38. Isolating real roots of real polynomials
    Kurt Mehlhorn and Michael Sagraloff
    In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), Seoul, Republic of Korea, 2009, 247-254
  39. A deterministic Bitstream Descartes Algorithm
    Kurt Mehlhorn and Michael Sagraloff
    University of Groningen, 9700 AB Groningen THE NETHERLANDS, ACS-TR-361502-03, Technical Report. Note: accepted to ISSAC 2009
  40. A General Approach to the Analysis of Controlled Perturbation Algorithms
    Kurt Mehlhorn, Ralf Osbild, and Michael Sagraloff
    University of Groningen, 9700 AB Groningen THE NETHERLANDS, ACS-TR-361502-02, Technical Report
  41. Algorithms and Data Structures: The Basic Toolbox
    Kurt Mehlhorn and Peter Sanders
    , Springer, Berlin, 2008, 300 p.
  42. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre

    [PDF: Download: RefereeAssignment.pdf]
  43. Classroom Examples of Robustness Problems in Geometric Computations
    Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Computational Geometry: Theory and Applications 40 (1): 61-78, 2008

  44. Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
    Kurt Mehlhorn, T. Kavitha, and R. Hariharan
    SIAM Journal of Computing 38 (4): 1430-1447, 2008
    [PDF: Download: DirectedCycleBasisJournal.pdf]
  45. Algorithms to compute minimum cycle basis in directed graphs
    Telikepalli Kavitha and Kurt Mehlhorn
    Theory of Computing Systems 40 (4): 485-505, 2007

  46. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
    Peter Hachenberger, Lutz Kettner, and Kurt Mehlhorn
    Computational Geometry: Theory and Applications 38 (1-2): 64-99, 2007

  47. Cycle Bases of Graphs and Sampled Manifolds
    Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, and Evangelia Pyrga
    Computer Aided Geometric Design 24 (8/9): 464 p., 2007. Note: accepted for publication in Computer Aided Geometric Design journal

  48. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    Journal of Experimental Algorithmics 11: 1-14, 2007
    [PDF: Download: Mehlhorn2007b.pdf]
  49. Matchings in Graphs Variations of the Problem
    Kurt Mehlhorn
    In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, Xi’an, China, 2007, 1-2

  50. Minimum Cycle Bases in Graphs Algorithms and Applications
    Kurt Mehlhorn
    In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, Cˇ eský Krumlov, Czech Republic, 2007, 13-14

  51. New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 512-523
    [PDF: Download: Mehlhorn_2007_a_m.pdf]
  52. Popular Matchings
    David J. Abraham, Robert W. Irving, Telikepalli Kavitha, and Kurt Mehlhorn
    SIAM Journal on Computing 37 (4): 1030-1045, 2007

  53. Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna E. Paluch
    ACM Transactions on Algorithms 3 (2): 15.1-15.18, 2007

  54. Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics
    Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, and Ron Wein
    University of Groningen, Groningen, ACS-TR-241402-02, Technical Report
  55. Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
    Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, and Ron Wein
    In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, 2007, 645-656

  56. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
    Ramesh Hariharan, Kavitha Telikepalli, and Kurt Mehlhorn
    In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, Venice, Italy, 2006, 250-261
    [PDF: Download: Mehlhorn_2006_a_m.pdf]
  57. Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
    Dieter Kratsch, Ross McConnell, Kurt Mehlhorn, and Jeremy P. Spinrad
    SIAM Journal on Computing 36 (2): 326-353, 2006

  58. Controlled Perturbation for Delaunay Triangulations
    Stefan Funke, Christian Klein, Kurt Mehlhorn, and Susanne Schmitt
    Algorithms for Complex Shapes with certified topology and numerics, Instituut voor Wiskunde en Informatica, ACS-TR-121103-03, Technical Report
    [PDF: Download: acstr12110303.pdf]
  59. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    ACM Journal of Experimental Algorithmics 11: 1-14, 2006

  60. Matching Algorithms are Fast in Sparse Random Graphs
    Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    Theory of Computing Systems 39 (1): 3-14, 2006

  61. New bounds for the Descartes method
    Werner Krandick and Kurt Mehlhorn
    Journal of Symbolic Computation 41 (1): 49-66, 2006
    [PDF: Download: Mehlhorn_a_2006_e.pdf]
  62. Polyline Fitting of Planar Points under Min-sum Criteria
    Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, and Takeshi Tokuyama
    International Journal of Computational Geometry and Applications 16 (2/3): 97-116, 2006
  63. Rank-Maximal Matchings
    Robert W. Irving, Kavitha Telikepalli, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    ACM Transactions on Algorithms 2 (4): 602-610, 2006

  64. Reliable and Efficient Computational Geometry Via Controlled Perturbation
    Kurt Mehlhorn, Ralf Osbild, and Michael Sagraloff
    In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, Venice, Italy, 2006, 299-310

  65. Reliable and Efficient Geometric Computing
    Kurt Mehlhorn
    In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, 2006, 1-2
  66. Reply to "Backward Error Analysis ..."
    Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    In: Computational Science and Its Applications - ICCSA 2006, I, Glasgow, UK, 2006, 60-60
  67. A Descartes algorithm for polynomials with bit-stream coefficients
    Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, and Nicola Wolpert
    In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, Kalamata, Greece, 2005, 138-149
    [PDF: Download: AG1_003.pdf] [PDF: Download: Mehlhorn_a_2005_a.pdf]
  68. A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
    Telikepalli Kavitha and Kurt Mehlhorn
    In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005, 654-665
    [PDF: Download: 185.pdf] [PDF: Download: Mehlhorn184.pdf]
  69. Certifying Algorithms (draft)
    Kurt Mehlhorn, Arno Eigenwillig, Kanela Kaligosi, Dieter Kratsch, Ross McConnell, Ulrich Meyer, and Jeremy P. Spinrad
    . Note: draft
  70. Controlled Perturbation for Delaunay Triangulations
    Stefan Funke, Christian Klein, Kurt Mehlhorn, and Susanne Schmitt
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 1047-1056

  71. EXACUS: Efficient and exact algorithms for curves and surfaces
    Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, and Nicola Wolpert
    In: 13th Annual European Symposium on Algorithms (ESA 2005), Palma de Mallorca, Spain, 2005, 155-166

  72. Harald Ganzinger : 31.10.1950 - 3.6.2004
    Kurt Mehlhorn, Uwe Waldmann, and Reinhard Wilhelm
    In: MPG-Jahrbuch, 2005, 107-108
  73. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini, Greece, 2005, 32-43
    [PDF: Download: 187.pdf]
  74. Minimum Cycle Bases and Surface Reconstruction
    Kurt Mehlhorn
    In: Graph Drawing: 13th International Symposium, GD 2005, ,, Limerick, Ireland, 2005, 532-532
  75. Network Problems with Non-Polynomial Weights and Applications
    Kurt Mehlhorn and Dimitrios Michail

    [PDF: Download: 181.pdf]
  76. New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
    Surender Baswana, Kavitha Telikepalli, Kurt Mehlhorn, and Seth Pettie
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 672-681

  77. Pareto Optimality in House Allocation Problems
    David J. Abraham, Katarína Cechlárová, David Manlove, and Kurt Mehlhorn
    In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 1163-1175
  78. Popular Matchings
    David Abraham, Robert W. Irving, Kurt Mehlhorn, and Kavitha Telikepalli
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 424-432

  79. Structural filtering: a paradigm for efficient and exact geometric programs
    Stefan Funke, Kurt Mehlhorn, and Stefan Näher
    Computational Geometry 31 (3): 179-194, 2005

  80. Towards Optimal Multiple Selection
    Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, and Peter Sanders
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 103-114
    [PDF: Download: Mehlhorn_a_2005_o.pdf]
  81. A Faster Algorithm for Minimum Cycle Basis of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, 2004, 846-857
    [PDF: Download: 179.pdf] [PDF: Download: Mehlhorn178.pdf]
  82. An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs
    Eric Berberich, Arno Eigenwillig, Ioannis Emiris, Efraim Fogel, Michael Hemmer, Dan Halperin, Athanasios Kakargias, Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Elmar Schömer, Monique Teillaud, Ron Wein, and Nicola Wolpert
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-01, Report
    [PDF: Download: ECG-TR-361200-01.pdf]
  83. An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons
    G. Konidaris, Kurt Mehlhorn, and D.A. Shell

    [PS: Download: Mehlhorn_a_2004_c_polyadj.ps]
  84. Classroom Examples of Robustness Problems in Geometric Computations
    Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363100-01, Technical Report
  85. Classroom Examples of Robustness Problems in Geometric Computations
    Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    In: ESA 2004: 12th Annual European Symposium on Algorithms, Bergen, Norway, 2004, 702-713

  86. Matching Algorithms Are Fast in Sparse Random Graphs
    Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 81-92

  87. New Bounds for the Descartes Method
    Werner Krandick and Kurt Mehlhorn
    Drexel University, Philadelphia, DU-CS-04-04, Technical Report
  88. Pareto-optimality in house allocation problems
    David Abraham, Katarina Cechlárová, David F. Manlove, and Kurt Mehlhorn
    In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, 2004, 3-15

  89. Point Containment in the Integer Hull of a Polyhedron
    Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, and Kurt Mehlhorn
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 929-933

  90. Polyline Fitting of Planar Points Under Min-sum Criteria
    Boris Aranov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, and Takeshi Tokuyama
    In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, HongKong, China, 2004, 77-88

  91. Rank-Maximal Matchings
    Kurt Mehlhorn, Dimitrios Michail, Kavitha Telikepalli, Robert W. Irving, and Katarzyna Paluch
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 68-75

  92. Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 222-233

  93. The LEDA class real number -- extended version
    Stefan Funke, Kurt Mehlhorn, Susanne Schmitt, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363110-01, Report
  94. EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
    Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Dennis Weber, and Nicola Wolpert
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-02, Technical Report
  95. A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
    Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    Algorithmica 36 (1): 75-88, 2003

  96. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
    Journal of Algorithms 48: 194-219, 2003

  97. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
    Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-241100-02, Report
  98. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
    Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, 2003, 654-666

  99. Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
    Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, and Dennis Weber
    In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, January, 12-14, 2003, 255-256

  100. Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
    Dieter Kratsch, Ross McConnell, Kurt Mehlhorn, and Jeremy P. Spinrad
    In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, 2003, 158-167. Note: Final version in SIAM J. Comput.
    [PDF: Download: Mehlhorn_a_2003_e.pdf] [PDF: Download: 164.pdf]
  101. Infimaximal frames: A technique for making lines look like segments
    Kurt Mehlhorn and Michael Seel
    International Journal of Computational Geometry & Applications 13 (3): 241-255, 2003

  102. Optimal Search for Rationals
    St. Kwek and Kurt Mehlhorn
    Information Processing Letters 86: 23-26, 2003

  103. Scanning Multiple Sequences via Cache Memory
    Kurt Mehlhorn and Peter Sanders
    Algorithmica 35 (1): 75-93, 2003

  104. Smoothed Analysis of Three Combinatorial Problems
    Cyril Banderier, Rene Beier, and Kurt Mehlhorn
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovak Republic, August, 25 - August, 29, 2003, 198-207

  105. The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
    Kurt Mehlhorn
    In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 2003, 255-263

  106. The Reliable Algorithmic Software Challenge RASC
    Kurt Mehlhorn
    In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, May, 26 - May, 28, 2003, 222-222

  107. A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
    Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, and Elmar Schömer
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 174-186

  108. All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
    Kurt Mehlhorn, Volker Priebe, Guido Schäfer, and Naveen Sivadasan
    Information Processing Letters 81 (6): 341-343, 2002

  109. Exact geometric computation
    Kurt Mehlhorn
    In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), Athens, Greece, 2002, 87-87
  110. External-Memory Breadth-First Search with Sublinear I/O
    Kurt Mehlhorn and Ulrich Meyer
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 723-735

  111. Implementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
    Kurt Mehlhorn and Guido Schäfer
    Journal of Experimental Algorithmics 7, 2002

  112. LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
    Stefan Funke and Kurt Mehlhorn
    Computational Geometry - Theory and Applications 22 (1-3): 99-118, 2002
  113. SCIL - Symbolic Constraints in Integer Linear Programming.
    Ernst Althaus, Alexander Bockmayr, Matthias Elf, Thomas Kasper, Michael Jünger, and Kurt Mehlhorn
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rom, Italy, 2002, 75-87

  114. A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
    Kurt Mehlhorn and Guido Schäfer
    In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Arhus, Denmark, August, 28-31, 2001, 242-253
  115. A Remark on the Sign Variation Method for Real Root Isolation
    Kurt Mehlhorn

    [PS: Download: Mehlhorn_a_2001_d_Descartes.ps]
  116. A Separation Bound for Real Algebraic Expressions
    Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, and Susanne Schmitt
    In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Aarhus, Denmark, August, 28-31, 2001, 254-265

  117. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington DC, USA, January, 7 - January, 9, 2001, 815-824
  118. Exact computation with leda_real - Theory and geometric applications
    Kurt Mehlhorn and Stefan Schirra
    In: Symbolic Algebraic Methods and Verification Methods, 2001, 163-172
    [PDF: Download: Mehlhorn145.pdf]
  119. From Algorithm to Program to Software Library
    Kurt Mehlhorn
    In: Informatics : 10 years back, 10 years ahead, 2001, 268-273

  120. Furthest site abstract Voronoi diagrams
    Kurt Mehlhorn, Stefan Meiser, and Ronald Rasch
    International Journal of Computational Geometry & Applications 11 (6): 583-616, 2001. Note: A preliminary version appeared as technical report MPI-I-92-125, www.mpi-sb.mpg.de/ mehlhorn/ftp/furthest-site-voronoi.ps.gz

  121. Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    International Journal of Computational Geometry & Applications 11 (3): 305-337, 2001. Note: Special issue edited by J Hershberger: Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, MN, June, 1998
  122. Traveling Salesman-Based Curve Reconstruction in Polynomial Time
    Ernst Althaus and Kurt Mehlhorn
    SIAM Journal on Computing 31 (1): 27-66, 2001
    [PDF: Download: Mehlhorn_a_2001_j.pdf] [PDF: Download: 143.pdf]
  123. CNOP - A Package for Constrained Network Optimization
    Kurt Mehlhorn and Mark Ziegelmann
    In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, Washington, DC, USA, January, 5 - January, 6, 2001, 17-31
    [PDF: Download: Mehlhorn_159.pdf] [PDF: Download: 159mehlhorn159.pdf]
  124. A polyhedral approach to sequence alignment problems
    John Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, and Martin Vingron
    Discrete Applied Mathematics 104 (1/3): 143-186, 2000

  125. A Polynomial-Time Fragment of Dominance Constraints
    Alexander Koller, Kurt Mehlhorn, and Joachim Niehren
    In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), Hong-Kong, October, 3-6, 2000, 368-375
    [PDF: Download: 151.pdf] [PDF: Download: Mehlhorn151.pdf]
  126. A strong and easily computable separation bound for arithmetic expressions involving radicals
    Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
    Algorithmica 27 (1): 87-99, 2000

  127. Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
    Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, and Volker Priebe
    Random Structures & Algorithms 16 (1): 33-46, 2000
    [PDF: Download: mehlhorn128.pdf]
  128. Constraint Programming and Graph Algorithms
    Kurt Mehlhorn
    In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), Geneva, Switzerland, July, 9-15, 2000, 571-575

  129. Curve reconstruction: Connecting dots with good reason
    Tamal K. Dey, Kurt Mehlhorn, and Edgar A. Ramos
    Computational Geometry 15 (4): 229-244, 2000

  130. Editorial
    Kurt Mehlhorn and Jörg-Rüdiger Sack
    Computational Geometry 17 (1/2): 1-2, 2000
  131. Experiments on curve reconstruction
    Ernst Althaus, Kurt Mehlhorn, Stefan Näher, and Stefan Schirra
    In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), San Francisco, USA, Jan, 6-11, 2000, 103-114

  132. Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
    Kurt Mehlhorn and Sven Thiel
    In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, Singapore, September, 18 - September, 21, 2000, 306-319

  133. Geometric Computing with CGAL and LEDA
    Kurt Mehlhorn and Stefan Schirra
    In: Curve and surface design, Saint-Malo 1999, Saint-Malo, France, July 1, - July 7, 2000, 277-286
    [PDF: Download: 146.pdf]
  134. Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
    Kurt Mehlhorn and Guido Schäfer
    In: 4th International Workshop on Algorithm Engineering, Saarbrücken, Germany, September, 5-8, 2000, 23-38
    [PDF: Download: 154.pdf]
  135. LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
    Stefan Funke and Kurt Mehlhorn
    In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), Hong Kong, China, June 12-14, 2000, 2000, 156-165
    [PDF: Download: mehlhorn149.pdf]
  136. Resource Constrained Shortest Paths
    Kurt Mehlhorn and Mark Ziegelmann
    In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), Saarbrücken, Germany, September, 5-8, 2000, 326-337

  137. TSP-Based Curve Reconstruction in Polynomial Time
    Ernst Althaus and Kurt Mehlhorn
    In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), San Francisco, USA, January, 9-11, 2000, 686-695
  138. A correctness certificate for the Stoer-Wagner min-cut algorithm
    Srinivasa Rao Arikati and Kurt Mehlhorn
    Information Processing Letters 70 (5): 251-254, 1999
    [PDF: Download: Mehlhorn_a_1999_a.pdf] [PDF: Download: 141.pdf]
  139. An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
    Joseph Cheriyan and Kurt Mehlhorn
    Information Processing Letters 69 (5): 239-242, 1999

  140. Checking geometric programs or verification of geometric structures
    Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, and Christian Uhrig
    Computational Geometry: Theory and Applications 12 (1-2): 85-104, 1999

  141. Checking Priority Queues
    Ulrich Finkler and Kurt Mehlhorn
    In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), Baltimore, Maryland, USA, 1999, 901-902
  142. Curve reconstruction: Connecting dots with good reason
    Tamal K. Dey, Kurt Mehlhorn, and Edgar A. Ramos
    In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, Florida, June 13-16, 1999, 1999, 197-206
  143. Editorial
    Kurt Mehlhorn, Jörg-Rüdiger Sack, and Jorg Urrutia
    Computational Geometry 12 (3/4): 153-154, 1999
  144. Efficient exact geometric computation made easy
    Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
    In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, USA, June, 13- June, 16, 1999, 341-350

  145. I/O-optimal computation of segment intersections
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, May 20-22, 1998, 1999, 131-138
  146. LEDA-SM : Extending LEDA to Secondary Memory
    Andreas Crauser and Kurt Mehlhorn
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, London, UK, July,19 - July, 21, 1999, 228-242
    [PDF: Download: Mehlhorn_a_1999_j.pdf] [PDF: Download: 138.pdf]
  147. LEDA: a platform for combinatorial and geometric computing
    Kurt Mehlhorn and Stefan Näher
    , Cambridge University Press, Cambridge, 1999, 1018 p.
  148. On the Expected Depth of Random Circuits
    Sunil Arya, Mordecai J. Golin, and Kurt Mehlhorn
    Combinatorics, Probability and Computing 8 (209-228): 209-228, 1999
  149. Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
    Stefan Funke, Kurt Mehlhorn, and Stefan Näher
    In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), Vancouver, Canada, August, 15-18, 1999, 39-42

  150. Ten Years of LEDA Some Thoughts (Abstract)
    Kurt Mehlhorn
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, London, UK, May 20-22, 1998, 1999, 14-14
  151. The Engineering of Some Bipartite Matching Programs
    Kurt Mehlhorn
    In: Algorithms and computation : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999, 1999, 1-3
  152. The Engineering of Some Bipartite Matching Programs
    Kurt Mehlhorn
    In: Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 16-18, 1999, 1999, 446-449
  153. A computational basis for higher-dimensional computational geometry and applications
    Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    Computational Geometry: Theory and Applications 10 (4): 289-304, 1998
  154. A Parallelization of Dijkstra's Shortest Path Algorithm
    Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
    In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), Brno, Czech Republic, August, 24 - August, 28, 1998, 722-731

  155. Amortisierte Analyse
    Kurt Mehlhorn
    In: Prinzipien des Algorithmenentwurfs, 1998, 91-102
    [PDF: Download: mehlhorn120.pdf]
  156. From Algorithms to Working Programs on the Use of Program Checking in LEDA
    Kurt Mehlhorn and Stefan Näher
    In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, Vienna, Austria and Budapest, Hungary, August 20-22, 1998, 81-88
  157. From Algorithms to Working Programs: On the Use of Program Checking in LEDA
    Kurt Mehlhorn and Stefan Näher
    In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, Brno, Czech Republic, August, 24 - August, 28 1998, 1998, 84-93
    [PDF: Download: Mehlhorn_a_1998_f.pdf]
  158. Maximum Network Flow with Floating Point Arithmetic
    Ernst Althaus and Kurt Mehlhorn
    Information Processing Letters 66 (3): 109-113, 1998

  159. Randomized External-Memory Algorithms for some Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, Minnesota, June 7-10, 1998, 259-268

  160. A Branch-And-Cut algorithm for multiple sequence alignment
    Knut Reinert, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, and John Kececioglu
    In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), Santa Fe, USA, January 20-23, 1997, 241-250

  161. A complete roundness classification procedure
    Kurt Mehlhorn, Thomas C. Shermer, and Chee Yap
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - 6, 1997, 129-138

  162. A Computational Basis for Higher-dimensional Computational Geometry and Applications
    Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - June, 6, 1997, 254-263
  163. A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
    Kurt Mehlhorn, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
    In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), New Orleans, USA, January, 5-7, 1997, 702-709
  164. Average-case complexity of shortest-paths problems in the vertex-potential model
    Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, and Volker Priebe
    In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), Bologna, Italy, July 11--12, 1997, 1997, 15-26
  165. Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
    Andreas Crauser, Kurt Mehlhorn, and Ulrich Meyer
    In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", Aachen, Germany, September, 22-23, 1997, 113-132
  166. Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
    Kurt Mehlhorn, R. Sundar, and Christian Uhrig
    Algorithmica 17 (2): 183-198, 1997
  167. On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
    Kurt Mehlhorn and Volker Priebe
    Random Structures Algorithms 10 (1/2): 205-220, 1997
  168. Runtime Prediction of Real Programs on Real Machines
    Ulrich Finkler and Kurt Mehlhorn
    In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), New Orleans, USA, January 5-7, 1997, 380-389
  169. The LEDA platform for combinatorial and geometric computing
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), Bologna, Italy, July 7-11, 1997, 7-16
  170. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    Algorithmica 16 (4/5): 543-547, 1996
    [PDF: Download: Mehlhorn_a_1996_b.pdf]
  171. Algorithms for Dense Graphs and Networks on the Random Access Computer
    Joseph Cheriyan and Kurt Mehlhorn
    Algorithmica 15 (5): 521-549, 1996

  172. An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    SIAM Journal on Computing 25 (6): 1144-1170, 1996
  173. Checking Geometric Programs or Verification of Geometric Structures
    Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, and Christian Uhrig
    In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), Philadelphia, PA, USA, May, 24-26, 1996, 159-165
  174. Komplexitätstheorie und Algorithmik
    Kurt Mehlhorn, Volker Claus, and Wolfgang Thomas
    In: Informatik : Grundlagen - Anwendungen - Perspektiven, Dagstuhl, Germany, 1996, 113-116
  175. On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
    Kurt Mehlhorn and Petra Mutzel
    Algorithmica 16 (2): 233-242, 1996

  176. Position Paper for Panel Discussion
    Kurt Mehlhorn
    In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, Philadelphia, PA, USA, August, 16th - 18th, 1996, 51-52
  177. The LEDA Platform for Combinatorial and Geometric Computing
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, Klagenfurt; Österreich, 1996, 43-50
  178. The LEDA Platform of Combinatorial and Geometric Computing
    Kurt Mehlhorn
    In: Proceedings of Conference on Computing: The Australian Theory Symposium, Townsville, 1996, 126-126
  179. A communication-randomness tradeoff for two-processor systems
    Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn
    Information and Computation 116 (2): 155-161, 1995
  180. Exact Geometric Computation in LEDA
    Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    In: 11th ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, C18-C19

  181. Experiences with the implementation of geometric algorithms
    Kurt Mehlhorn
    In: Algorithms and Data Structures: 4th International Workshop (WADS95), Kingston, Canada, August, 16th - 18th, 1995, 518-518
  182. Guest Editor's Foreword
    Kurt Mehlhorn
    Discrete and Computational Geometry 14 (4): 363-363, 1995
  183. LEDA : A Platform for Combinatorial and Geometric Computing
    Kurt Mehlhorn and Stefan Näher
    Universität Halle, Halle, 95-10, Reports on Computer Science
  184. LEDA: A Platform for Combinatorial and Geometric Computing
    Kurt Mehlhorn and Stefan Näher
    Communications of the ACM 38 (1): 96-102, 1995

  185. Lower bounds for set intersection queries
    Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
    Algorithmica 14 (2): 154-168, 1995

  186. On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
    Kurt Mehlhorn and Volker Priebe
    In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 185-198
  187. A linear-time algorithm for the homotopic routing problem in grid graphs
    Michael Kaufmann and Kurt Mehlhorn
    SIAM Journal on Computing 23 (2): 227-246, 1994
    [PDF: Download: HomotopicRoutingGridGraphs.pdf]
  188. A lower bound for area-universal graphs
    Gianfranco Bilardi, Shiva Chaudhuri, Devdatt Dubhashi, and Kurt Mehlhorn
    Information Processing Letters 51 (2): 101-105, 1994

  189. Dynamic point location in general subdivisions
    Hanna Baumgarten, Hermann Jung, and Kurt Mehlhorn
    Journal of Algorithms 3 (17): 342-380, 1994

  190. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
    SIAM Journal on Computing 23 (4): 738-761, 1994

  191. How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
    Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra
    In: Algorithms (ESA-94) : 2nd annual European symposium, Utrecht, The Netherlands, September 26-28, 1994, 1994, 227-239

  192. Introduction
    Kurt Mehlhorn, Stefan Näher, and Jurg Nievergelt
    Journal of Symbolic Computation 17 (4): 295-295, 1994
    [PDF: Download: Mehlhorn_a_1994_g.pdf]
  193. Maintaining dynamic sequences under equality-tests in polylogarithmic time
    Kurt Mehlhorn, R. Sundar, and Christian Uhrig
    In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, Arlington, USA, 1994, 213-222
  194. On degeneracy in geometric computations
    Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra
    In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, Arlington, USA, 1994, 16-23
    [PDF: Download: DegeneracyGeometry.pdf]
  195. The Implementation of Geometric Algorithms
    Kurt Mehlhorn and Stefan Näher
    In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 1994, 223-231
    [PDF: Download: Mehlhorn112.pdf]
  196. A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
    Katrin Dobrindt, Kurt Mehlhorn, and Mariette Yvinec
    In: Algorithms and data structures (WADS-93) : 3rd workshop, Montréal, Canada, 1993, 314-324

  197. A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
    Katrin Dobrindt, Kurt Mehlhorn, and Mariette Yvinec
    INRIA, Le Chesnay Cedex, 2023
  198. Dynamic Interpolation Search
    Kurt Mehlhorn and Athanasios K. Tsakalidis
    Journal of the ACM 40 (3): 621-634, 1993
  199. Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
    Ludek Kucera, Kurt Mehlhorn, B. Preis, and E. Schwarzenecker
    In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, Würzburg, Germany, 1993, 317-322

  200. Four Results on Randomized Incremental Constructions
    Kenneth L. Clarkson, Kurt Mehlhorn, and Raimund Seidel
    Computational Geometry: Theory and Applications 3 (4): 185-212, 1993

  201. Lower Bounds for Set Intersection queries
    Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
    In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, Austin, USA, 1993, 194-201
  202. Maintaining Discrete Probability Distributions Optimally
    Torben Hagerup, Kurt Mehlhorn, and I. Munro
    In: Automata, languages and programming (ICALP-93) : 20th international colloquium, Lund, Sweden, 1993, 253-264

  203. Randomized incremental construction of abstract Voronoi diagrams
    Rolf Klein, Kurt Mehlhorn, and Stefan Meiser
    Computational Geometry: Theory and Applications 3 (3): 157-184, 1993
    [PDF: Download: RandomizedIncrementalAbstractVD.pdf]
  204. Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
    Devdatt P. Dubhashi, Desh Ranjan, Kurt Mehlhorn, and Christian Thiel
    In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, Bombay, India, 1993, 436-443

  205. Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
    Kurt Mehlhorn, Micha Sharir, and Emo Welzl
    Computational Geometry: Theory and Applications 3 (4): 235-246, 1993

  206. A lower bound for the nondeterministic space complexity of context-free recognition
    Helmut Alt, Viliam Geffert, and Kurt Mehlhorn
    Information Processing Letters 42 (1): 25-27, 1992

  207. Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
    Kurt Mehlhorn and Stefan Näher
    In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, Madrid, Spain,, 1992, 493-508
    [PDF: Download: Mehlhorn102.pdf]
  208. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
    Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    Algorithmica 8 (5/6): 391-408, 1992. Note: Conference version in Proceedings of 6th ACM Symposium on Computational Geometry, 1990
  209. Dynamic Point Location in General Subdivisions
    Hanna Baumgarten, Hermann Jung, and Kurt Mehlhorn
    In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, Orlando, FL, USA, 1992, 250-258
  210. Four Results on Randomized Incremental Constructions
    Kenneth L. Clarkson, Kurt Mehlhorn, and Raimund Seidel
    In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, Cachan, France, 1992, 463-474
  211. On local routing of two-terminal nets
    Michael Kaufmann and Kurt Mehlhorn
    Journal of Combinatorial Theory / Series B 55: 33-72, 1992
    [PDF: Download: LocalRoutingTwoTerminalNets.pdf]
  212. Randomized incremental construction of abstract Voronoi diagrams
    Rolf Klein, Kurt Mehlhorn, and Stefan Meiser
    In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 1992, 283-308
  213. Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
    Kurt Mehlhorn
    In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), New Delhi, India, 1992, 404-404
  214. Selected Topics from Computational Geometry, Data Structures and Motion Planning
    Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
    In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43
  215. Simultaneous Inner and Outer Approximation of Shapes
    Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
    Algorithmica 8 (5/6): 365-389, 1992
  216. Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
    Kurt Mehlhorn, Micha Sharir, and Emo Welzl
    In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, Orlando, FL, USA, 1992, 89-93
  217. $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
    Kurt Mehlhorn, Wolfgang J. Paul, and C Uhrig
    Information and Computation 101 (1): 123-129, 1992
    [PDF: Download: KVersusPlusOne.pdf]
  218. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Helmut Alt, L. Guibas, Kurt Mehlhorn, Richard M. Karp, and A. Wigderson
    ICSI, Berkeley, ICSI Technical Report tr-91-057
    [PDF: Download: Mehlhorn_a_1991_a.pdf]
  219. A Time-Randomness Tradeoff for Communication Complexity
    Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn
    In: Distributed Algorithms, 4th International Workshop, Bari, Italy, 1991, 390-401
  220. Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
    Helmut Alt, Norbert Blum, Kurt Mehlhorn, and Markus Paul
    Information Processing Letters 37 (4): 237-240, 1991

  221. Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
    Kurt Mehlhorn and Chee-Keng Yap
    SIAM Journal on Computing 20 (4): 603-621, 1991
  222. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
    Princeton University, Princeton, TR-310-91. Note: This technical report has been published as Dynamic Perfect Hashing: Upper and Lower Bounds. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert and Robert E. Tarjan, Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), 524-531 and SIAM J. Comput. 23 (1994) 738-761.
  223. On the construction of abstract Voronoi diagrams
    Kurt Mehlhorn, Stefan Meiser, and Colm O'Dúnlaing
    Discrete & Computational Geometry 6 (3): 211-224, 1991. Note: See also {\em Symp. Theor. Aspects of Comp. Sci.}, 1990, pp. 227--239
  224. A faster compaction algorithm with automatic jog insertion
    Kurt Mehlhorn and Stefan Näher
    IEEE Transactions on CAD of Integrated Circuits and Systems 9 (2): 158-166, 1990
  225. Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
    Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 281-289
  226. Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
    Kurt Mehlhorn and Stefan Näher
    Information Processing Letters 35 (4): 183-189, 1990
  227. Can a maximum flow be computed in $o(nm)$ time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, 90/07
    [PDF: Download: MaxFlowICALP90.pdf]
  228. Can A Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-90) : 17th international colloquium, Warwick University, England, 1990, 235-248
  229. Compaction on the torus
    Kurt Mehlhorn and W. Rülling
    IEEE Transactions on CAD of Integrated Circuits and Systems 9 (4): 389-397, 1990
    [PDF: Download: Mehlhorn72.pdf]
  230. Data Structures
    Kurt Mehlhorn and A. Tsakalidis
    In: Handbook of Theoretical Computer Science, 1990, 301-341
  231. Dynamic deferred data structuring
    Yu-Tai Ching, Kurt Mehlhorn, and Michiel H. M. Smid
    Information Processing Letters 35 (1): 37-40, 1990
  232. Dynamic Fractional Cascading
    Kurt Mehlhorn and Stefan Näher
    Algorithmica 5: 215-241, 1990
    [PDF: Download: DynamicFractionalCascading.pdf]
  233. Faster algorithms for the shortest path problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    Journal of the ACM 37 (2): 213-223, 1990
    [PDF: Download: p213-ahuja.pdf]
  234. Hidden line elimination for isooriented rectangles
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    Information Processing Letters 35 (3): 137-143, 1990
    [PDF: Download: HiddenLineRectangles.pdf]
  235. Hidden line elimination for isooriented rectangles
    Kurt Mehlhorn, Stefan Näher, and Christian Uhrig
    Universität des Saarlandes, Saarbrücken, A 90/02
    [PDF: Download: Mehlhorn_SFB_A_02_90-1.pdf]
  236. LEDA - A Library of Efficient Data Types and Algorithms
    Stefan Näher and Kurt Mehlhorn
    In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, Stuttgart, Germany, 1990, 35-39
  237. LEDA: A Library of Efficient Data Types and Algorithms
    Stefan Näher and Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-90) : 17th international colloquium, Warwick University, England, 1990, 1-5
  238. On Simultaneous Inner and Outer Approximation of Shapes
    Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
    In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 216-224
  239. On the Complexity of a Game Related to the Dictionary Problem
    Kurt Mehlhorn, Stefan Näher, and Monika Rauch
    SIAM Journal on Computing 19 (5): 902-906, 1990
  240. On the Construction of Abstract Voronoi Diagrams, II
    R. Klein, Kurt Mehlhorn, and Stefan Meiser
    In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), Tokyo, Japan, 1990, 138-154
  241. On the Construction of Abstract Voronoi Diagrams
    Kurt Mehlhorn, Stefan Meiser, and Colm Ó'Dúnlaing
    In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, Rouen, France, 1990, 227-239
  242. Routing problems in grid graphs
    Morgan Kaufmann and Kurt Mehlhorn
    In: Paths, Flows, and VLSI-Layout, 1990, 165–184 p.
  243. A library of efficient data types and algorithms
    Kurt Mehlhorn and S Näher
    In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, Porabka-Kozubnik, Poland, 1989, 88-106
  244. Data structures
    Kurt Mehlhorn and Athanasios K. Tsakalidis
    Universität des Saarlandes, Saarbrücken, A 89/02
    [PDF: Download: Mehlhorn_SFB_A_02_89.pdf]
  245. Foundations of Programming Languages
    Jacques Loeckx, Kurt Mehlhorn, and Reinhard Wilhelm
    , Wiley, New York, 1989, 426 p.
  246. LEDA: A library of efficient data types and algorithms
    Kurt Mehlhorn and Stefan Näher
    In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, Porabka-Kozubnik, Poland, 1989, 88-106
  247. On the construction of abstract Voronoi diagrams, II.
    R. Klein, Kurt Mehlhorn, and Stefan Meiser
    Universtität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 03/89, Technischer Bericht
    [PDF: Download: Mehlhorn_SFB_A_03_89.pdf]
  248. On the construction of abstract Voronoi diagrams
    Kurt Mehlhorn, Stefan Meiser, and Colm O'Dunlaing
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 89/01
    [PDF: Download: Mehlhorn_SFB_A_01_89.pdf]
  249. On the Complexity of a Game Related to the Dictionary Problem
    Kurt Mehlhorn, Stefan Näher, and Monika Rauch
    In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), Research Triangle Park, NC, USA, 1989, 546-548
  250. Routing problems in grid graphs
    Michael Kaufmann and Kurt Mehlhorn
    Institut für Ökonometrie und Operations Research «Bonn», Bonn, 89, 561
  251. Routing Problems in Grid Graphs
    Michael Kaufmann and Kurt Mehlhorn
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 89/05
  252. Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
    Kurt Mehlhorn and Wolfgang J. Paul
    In: Automata, languages and programming (ICALP-89) : 16th international colloquium, Stresa, Italy, 1989, 603-609
  253. AT$^2$-Optimal Galois Field Multiplier for VLSI
    Martin Fürer and Kurt Mehlhorn
    IEEE Transactions on Computers 38 (9): 1333-1336, 1989
    [PDF: Download: GaloisMultiplier.pdf]
  254. A faster approximation algorithm for the Steiner problem in graphs
    Kurt Mehlhorn
    Information Processing Letters 27 (3): 125-128, 1988
    [PDF: Download: SteinerTrees.pdf]
  255. A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
    Michael Kaufmann and Kurt Mehlhorn
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 88/17
  256. A Lower Bound on the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    SIAM Journal on Computing 17 (6): 1093-1102, 1988
  257. Compaction on the Torus
    Kurt Mehlhorn and W. Rülling
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 88/08
  258. Compaction on the Torus
    Kurt Mehlhorn and W. Rülling
    In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, 1988, 212-225
  259. Congruence, Similarity, and Symmetries of Geometric Objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Discrete and Computational Geometry 3: 237-256, 1988
    [PDF: Download: CongruenceSimilarity.pdf]
  260. Constructive Hopf's theorem: or how to untangle closed planar curves
    Kurt Mehlhorn and Chee-Keng Yap
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 88/01
  261. Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
    Kurt Mehlhorn and Chee-Keng Yap
    In: Automata, languages and programming (ICALP-88) : 15th international colloquium, Tampere, Finland, 1988, 410-423
  262. Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen
    Kurt Mehlhorn
    , Teubner, Stuttgart, 1988, 317 p.
  263. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan
    In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), White Plains, New York, USA, 1988, 524-531
  264. Faster Algorithms for the Shortest Path Problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 88/04
  265. Faster Algorithms for the Shortest Path Problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    MIT Operations Research Center, Cambridge, TR-193
  266. On Continuous Homotopic One Layer Routing
    Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, and Wolfgang Rülling
    In: Computational geometry (SCG-88) : 4th symposium, Urbana-Champaign, IL, USA, 1988, 392-402
    [PDF: Download: Mehlhorn_a_1988_m.pdf]
  267. On Continuous Homotopic One Layer Routing (Extended Abstract)
    Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, and Mark Jerrum
    In: Computational geometry and its applications (CG-88) : international workshop, Würzburg, FRG, 1988, 55-70
  268. Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
    Hermann Jung and Kurt Mehlhorn
    Information Processing Letters 27 (5): 227-236, 1988
    [PDF: Download: IndependentSets.pdf]
  269. SFB 124: VLSI-Entwurfsmethoden und Parallelität
    Kurt Mehlhorn
    In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, Hamburg, Germany, 1988, 3-29
  270. Upper and Lower Bounds for the Dictionary Problem
    Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert
    In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, Halmstad, Sweden, 1988, 214-215
  271. A faster compaction algorithm with automatic jog insertion
    Kurt Mehlhorn and Stefan Näher
    Sonderforschungsbereich 124 / Universität des Saarlandes, Saarbrücken/Kaiserslautern, 87/15
  272. A Faster Approximation Algorithm for the Steiner Problem in Graphs
    Kurt Mehlhorn
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 87/11
  273. A Lower Bound for the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, 1987, 479-488
  274. A $\log \log n$ data structure for three-sided range queries
    O. Fries, Kurt Mehlhorn, Stefan Näher, and A. Tsakalidis
    Information Processing Letters 25 (4): 269-273, 1987
  275. Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
    Kurt Mehlhorn and Franco P. Preparata
    Information and Computation 72 (3): 270-282, 1987
    [PDF: Download: Mehlhorn65.pdf]
  276. Congruence, similarity and symmetries of geometric objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 02/87, Technischer Bericht
    [PDF: Download: Mehlhorn_SFB_A_02_87.pdf]
  277. Convergence, Similarity and Symmetries of Geometric Objects
    Helmut Alt, Kurt Mehlhorn, Hubert Wagener, and Emo Welzl
    In: Computational geometry (SCG-87) : 3rd symposium, Waterloo, Canada, 1987, 308-315
  278. Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    In: Parallel Algorithms and Architectures : International Workshop, Suhl, FRG, 1987, 11-15
    [PDF: Download: DeterministicSimulationParallel.pdf]
  279. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    SIAM Journal on Computing 16 (5): 808-835, 1987
  280. On Local Routing of Two-Terminal Nets
    Michael Kaufmann and Kurt Mehlhorn
    In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, 1987, 40-52
  281. Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
    Hermann Jung and Kurt Mehlhorn
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 87/01
  282. A Lower Bound for the Complexity of the Union-Split-Find Problem
    Kurt Mehlhorn, Stefan Näher, and Helmut Alt
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 86/07
  283. Algorithms for Routing in Planar Graphs
    Michael Becker and Kurt Mehlhorn
    Acta Informatica 23 (2): 163-176, 1986

  284. An Amortized Analysis of Insertions into AVL-Trees
    Kurt Mehlhorn and Athanasios K. Tsakalidis
    SIAM Journal on Computing 15 (1): 22-33, 1986
    [PDF: Download: AmortizedAnalysisAVL.pdf]
  285. Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
    Kurt Mehlhorn and Franco P. Preparata
    In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, 1986, 341-352
  286. Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
    Kurt Mehlhorn, Franco P. Preparata, and Maji Sarrafzadeh
    Algorithmica 1 (2): 213-221, 1986
    [PDF: Download: ChannelRoutingKnockKneeMode.pdf]
  287. Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen
    Kurt Mehlhorn
    , Teubner, Stuttgart, 1986, 314 p.
  288. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), Bratislava, Czechoslovakia, 1986, 199-208
  289. Dynamic fractional cascading
    Kurt Mehlhorn and Stefan Näher
    Universität des Saarlandes, Saarbrücken, A 86/06
  290. Grundlagen der Programmiersprachen
    Jacques Loeckx, Kurt Mehlhorn, and Reinhard Wilhelm
    , Teubner, Stuttgart, 1986, 448 p.
  291. On Local Routing of Two-Terminal Nets
    Michael Kaufmann and Kurt Mehlhorn
    SFB Sonderforschungsbereich.124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 86/03
  292. On BF-orderable graphs
    Kurt Mehlhorn and Bernd H. Schmidt
    Discrete Applied Mathematics 15: 315-327, 1986
    [PDF: Download: BF-Orderable.pdf]
  293. Routing through a Generalized Switchbox
    Michael Kaufmann and Kurt Mehlhorn
    Journal of Algorithms 7 (4): 510-531, 1986
    [PDF: Download: RoutingGeneralizedSwitchbox.pdf]
  294. Routing through a Rectangle
    Kurt Mehlhorn and F. P. Preparata
    Journal of the ACM 33 (1): 60-85, 1986
    [PDF: Download: Mehlhorn_a_1986_n.pdf]
  295. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    Information and Control 68 (1--3): 170-184, 1986
    [PDF: Download: JordanSorting.pdf]
  296. Über Verdrahtungsalgorithmen
    Kurt Mehlhorn
    Informatik Spektrum 9 (4): 227-234, 1986
    [PDF: Download: Mehlhorn59.pdf]
  297. VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
    Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
    Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
  298. VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
    Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, and Paul G. Spirakis(Ed.)
    Lecture Notes in Computer Science. 227, , Springer, Berlin, 1986
  299. VLSI complexity, efficient VLSI algorithms and the HILL design system
    Thomas Lengauer and Kurt Mehlhorn
    In: Algorithmics for VLSI, 1986, 33-89
    [PDF: Download: Mehlhorn62.pdf]
  300. AT$^2$-Optimal Galois Field Multiplier for VLSI
    Martin Fürer and Kurt Mehlhorn
    In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, 1986, 217-225
  301. A fast algorithm for renaming a set of clauses as a Horn set
    Heikki Mannila and Kurt Mehlhorn
    Information Processing Letters 21 (5): 269-272, 1985
    [PDF: Download: RenamingHorn.pdf]
  302. Area-time optimal division for T=omega((logn)1+epsilon)
    Kurt Mehlhorn and Franco P. Preparata
    SFB Sonderforschungsbereich 124, Saarbrücken, 85/05
  303. Deterministic simulation of idealized parallel computers on more realistic ones
    Helmut Alt, Torben Hagerup, Kurt Mehlhorn, and Franco P. Preparata
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken/Kaiserslautern, 85/36
  304. Dynamic Interpolation Search
    Kurt Mehlhorn and Athanasios K. Tsakalidis
    In: Automata, languages and programming (ICALP-85) : 12th international colloquium, Nafplion, Greece, 1985, 424-434

  305. Dynamization of geometric data structures
    O. Fries, Kurt Mehlhorn, and Stefan Näher
    In: Computational geometry (SCG-85) : 1st symposium, Baltimore, MD, USA, 1985, 168-176
  306. Dynamization of geometric data structures
    O. Fries, Kurt Mehlhorn, and Stefan Näher
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 85/02
  307. Fast Triangulation of the Plane with Respect to Simple Polygons
    Stefan Hertel and Kurt Mehlhorn
    Information and Control 64 (1--3): 52-76, 1985
    [PDF: Download: FastTriangulation.pdf]
  308. Intersecting two polyhedra one of which is convex
    Kurt Mehlhorn and Klaus Simon
    In: FCT '85: Fundamentals of Computation Theory, Cottbus, GDR, 1985, 534-542

  309. On BF-perfect graphs
    Kurt Mehlhorn and Bernd H. Schmidt
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 85/34
  310. Routing Through a Generalized Switchbox
    Kurt Mehlhorn and Athanasios K. Tsakalidis
    In: Automata, languages and programming (ICALP-85) : 12th international colloquium, Nafplion, Greece, 1985, 328-337
  311. Searching Semisorted Tables
    Helmut Alt and Kurt Mehlhorn
    SIAM Journal on Computing 14 (4): 840-848, 1985
    [PDF: Download: SearchingSemiSortedTables.pdf]
  312. Sorting Jordan sequences in linear time
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    In: Computational geometry (SCG-85) : 1st symposium, Baltimore, MD, USA, 1985, 196-203
  313. $AT^2$-optimal VLSI integer division and integer square rooting
    Kurt Mehlhorn
    Integration, the VLSI Journal 2 (2): 163-167, 1984
  314. Algorithms for routing in planar graphs
    Michael Becker and Kurt Mehlhorn
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 84/07
    [PDF: Download: Mehlhorn_SFB_A_84_07.pdf]
  315. Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
    Kurt Mehlhorn and Franco P. Preparata
    In: Automata, languages and programming (ICALP-84) : 11th colloquium, Antwerp, Belgium, 1984, 347-357
  316. Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof
    Kurt Mehlhorn
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 84/11
  317. Data structures and algorithms. Volume 1 : Sorting and searching
    Kurt Mehlhorn
    , Springer, Berlin, 1984, 336 p.
  318. Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness
    Kurt Mehlhorn
    , Springer, Berlin, 1984, 260 p.
  319. Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry
    Kurt Mehlhorn
    , Springer, Berlin, 1984, 284 p.
  320. Four results on the complexity of VLSI computation
    Thomas Lengauer and Kurt Mehlhorn
    Advances in Computing Research 2: 1-22, 1984

  321. Intersecting a line and a simple polygon
    K Hoffmann and Kurt Mehlhorn
    EATCS Bulletin 22: 120-121, 1984
  322. Local routing of two-terminal nets is easy
    Michael Kaufmann and Kurt Mehlhorn
    Universität des Saarlandes / Fachbereich Informatik, Saarbrücken, A 84/12, Extended Abstract
    [PDF: Download: Mehlhorn_SFB_A_84_12.pdf]
  323. On Optimal VLSI-Circuits for the Basic Arithmetic Functions
    Kurt Mehlhorn
    In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), Bordeaux, France, 1984, 23-30
  324. On the complexity of partial match retrieval
    Helmut Alt, Kurt Mehlhorn, and J. Munro
    Information Processing Letters 19 (2): 61-65, 1984
  325. Partial match retrieval in implicit data structures
    Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
    Information Processing Letters 19 (2): 61-65, 1984
    [PDF: Download: PartialMatchRetrieval.pdf]
  326. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
    Kurt Mehlhorn and Uzi Vishkin
    Acta Informatica 21: 339-374, 1984
  327. Routing through a generalized switchbox
    Michael Kaufmann and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/11. Note: Also available as Report in SFB Sonderforschungsbereich 124; Report No 1984/17
    [PDF: Download: Mehlhorn_SFB_124.pdf]
  328. Sorting Jordan sequences in linear time
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/09
  329. Space sweep solves intersection of two convex polyhedra elegantly
    Stefan Hertel, Kurt Mehlhorn, Martti Mäntylä, and Jurg Nievergelt
    Universität des Saarlandes / Fachbereich Angewandte Mathematik und Informatik, Saarbrücken, A 84/02
    [PDF: Download: Mehlhorn_SFB_A_84_02.pdf]
  330. Space Sweep Solves Intersection of Convex Polyhedra
    Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, and Jurg Nievergelt
    Acta Informatica 21 (5): 501-519, 1984
    [PDF: Download: Mehlhorn_a_1984_p.pdf]
  331. The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
    Thomas Lengauer and Kurt Mehlhorn
    In: Proceedings, Conference on Advanced Research in VLSI, Cambridge, Mass., USA, 1984, 139-149
    [PDF: Download: Mehlhorn43.pdf]
  332. Über Verdrahtungsalgorithmen
    Kurt Mehlhorn
    In: GI Jahrestagung (Fachgespräche), Braunschweig, Germany, 1984, 79-89
  333. $AT^2$-optimal VLSI multipliers with minimum computation time
    Kurt Mehlhorn and F. P. Preparata
    Information & Control 58: 137-196, 1983
  334. $AT^2$-optimal VLSI for integer division and integer square rooting
    Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, 83/02
  335. A Single Shortest Path Algorithm for Graphs with Separators
    Kurt Mehlhorn and Bernd H. Schmidt
    In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), Borgholm, Sweden, 1983, 302-309
  336. Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
    Kurt Mehlhorn and Franco P. Preparata
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 05/1983
  337. Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
    Kurt Mehlhorn and Franco P. Preparata
    Information and Control 58: 137-156, 1983
    [PDF: Download: Mehlhorn39.pdf]
  338. Cost Trade-offs in Graph Embeddings, with Applications
    Jia-Wei Hong, Kurt Mehlhorn, and Arnold L. Rosenberg
    Journal of the ACM 30 (4): 709-728, 1983
    [PDF: Download: Mehlhorn_a_1983_f.pdf]
  339. Fast Triangulation of Simple Polygons
    Stefan Hertel and Kurt Mehlhorn
    In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), Borgholm, Sweden, 1983, 207-218
  340. Four results on the complexity of VLSI computations
    Thomas Lengauer and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 83/01. Note: Also available as SFB Sonderforcshungsbereich 124, Report No 1983/08
  341. Granularity of parallel memories
    Kurt Mehlhorn and Uzi Vishkin
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 83/10
  342. Routing through a Rectangle
    Kurt Mehlhorn and F. P. Preparata
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 83/07
  343. The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts
    Thomas Lengauer and Kurt Mehlhorn
    SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 83/02
    [PDF: Download: Mehlhorn_SFB_A_83_04-1.pdf]
  344. The Recognition of Deterministic CFL's in Small Time and Space
    Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn, and Rutger Verbeek
    Information and Control 56 (1/2): 34-51, 1983
  345. VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System
    Thomas Lengauer and Kurt Mehlhorn
    Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken, 83/06
  346. A New Data Structure for Representing Sorted Lists
    Scott Huddleston and Kurt Mehlhorn
    Acta Informatica 17 (2): 157-184, 1982
  347. A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
    Kurt Mehlhorn
    SIAM Journal on Computing 11 (4): 748-760, 1982

  348. A Probabilistic Algorithm for Vertex Connectivity of Graphs
    Michael Becker, W. Degenhardt, J. Doenhardt, S. Hertel, G. Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, H. Rohnert, and T. Winter
    Information Processing Letters 15 (3): 135-136, 1982
    [PDF: Download: mehlhorn34.pdf]
  349. Cost tradeoffs in graph embeddings, with applications
    Jia-Wei Hong and Kurt Mehlhorn
    Computer Science Department, Duke University
  350. Las Vegas Is better than Determinism in VLSI and Distributed Computing
    Kurt Mehlhorn and Erik M. Schmidt
    In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), San Francisco, California, USA, 1982, 330-337
  351. On the Program Size of Perfect and Universal Hash Functions
    Kurt Mehlhorn
    In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), Chicago, Illinois, USA, 1982, 170-175

  352. The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
    Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, and Derick Wood
    Information and Control 55 (1-3): 125-174, 1982
    [PDF: Download: ____FringeAnalysis.pdf]
  353. Arbitrary Weight Changes in Dynamic Trees
    Kurt Mehlhorn
    Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO 15 (3): 183-211, 1981

  354. Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
    Jia-Wei Hong, Kurt Mehlhorn, and Arnold L. Rosenberg
    In: Automata, languages and programming (ICALP-81) : 8th international colloquium, Acre (Akko), Israel, 1981, 41-55
  355. Lower bounds on the efficiency of transforming static data structures into dynamic structures
    Kurt Mehlhorn
    Mathematical Systems Theory 15: 1-16, 1981

  356. On the Complexity of VLSI-Computations
    Thomas Lengauer and Kurt Mehlhorn
    VLSI Systems and Computations : 89-99, 1981
  357. Optimal dynamization of decomposable searching problems
    Kurt Mehlhorn and Mark H. Overmars
    Information Processing Letters 12 (2): 93-98, 1981

  358. Partial Match Retrieval in Implicit Data Structures
    Helmut Alt, Kurt Mehlhorn, and J. Ian Munro
    In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, Strbské Pleso, Czechoslovakia, 1981, 156-161
  359. Robust balancing in B-trees
    S. Huddleston and Kurt Mehlhorn
    In: Theoretical computer science : 5th GI-conference, Karlsruhe, Germany, 1981, 234-244

  360. A New Data Structure for Representing Sorted Lists
    Kurt Mehlhorn
    In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, Bad Honnef/Bonn, Germany, 1980, 90-112
  361. An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
    Kurt Mehlhorn
    IEEE Transactions on Information Theory 26 (5): 513-517, 1980

  362. Binary Search Trees: Average and Worst Case Behavior
    Reiner Güttler, Kurt Mehlhorn, and Wolfgang Schneider
    Elektronische Informationsverarbeitung und Kybernetik 16 (1-3): 41-61, 1980

  363. Codes: Unequal Probabilities, Unequal Letter Cost
    Doris Altenkamp and Kurt Mehlhorn
    Journal of the ACM 27 (3): 412-427, 1980
    [PDF: Download: Mehlhorn_a_1980_d.pdf]
  364. Lower bounds on the efficiency of transforming static data structures into dynamic structures
    Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, A 80/05
  365. On the Average Number of Rebalancing Operations in Weight-Balanced Trees
    Norbert Blum and Kurt Mehlhorn
    Theoretical Computer Science 11 (3): 303-320, 1980

  366. Optimal dynamization of decomposable searching problems
    Kurt Mehlhorn and Mark H. Overmars
    Universität des Saarlandes, Saarbrücken, A 80/15
  367. Pebbling Mountain Ranges and its Application of DCFL-Recognition
    Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, Noordwijkerhout, The Netherlands, 1980, 422-435
    [PDF: Download: Mehlhorn.pdf]
  368. Complexity arguments in algebraic language theory
    Helmut Alt and Kurt Mehlhorn
    Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique 13 (3): 217-225, 1979

  369. Dynamic Binary Search
    Kurt Mehlhorn
    SIAM Journal on Computing 8 (2): 175-198, 1979
    [PDF: Download: Mehlhorn_a_1979_b.pdf]
  370. Dynamic data structures
    Kurt Mehlhorn
    Mathematical Centre Tracts 108: 71-96, 1979

  371. Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
    Kurt Mehlhorn
    In: GI - 9. Jahrestagung, Bonn, Germany, 1979, 16-22

  372. Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
    Norbert Blum and Kurt Mehlhorn
    In: Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, 1979, 67-78
    [PDF: Download: Blum.pdf]
  373. On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
    Kurt Mehlhorn and M. Tsagarakis
    Colloque de Lille `Les Arbres en Algebre et en Programmation' , 1979
  374. Parsing Macro Grammars Top Down
    Kurt Mehlhorn
    Information and Control 40 (2): 123-143, 1979

  375. Searching, Sorting and Information Theory
    Kurt Mehlhorn
    In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, Olomouc, Czechoslovakia, 1979, 131-145

  376. Some Remarks on Boolean Sums
    Kurt Mehlhorn
    In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, Olomouc, Czechoslovakia, 1979, 375-380
  377. Some Remarks on Boolean Sums
    Kurt Mehlhorn
    Acta Informatica 12: 371-375, 1979
    [PDF: Download: Mehlhorn_a_1979_j.pdf]
  378. Sorting Presorted Files
    Kurt Mehlhorn
    In: Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, 1979, 199-212

  379. An efficient algorithm for constructing nearly optimal prefix codes
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 13/78
  380. Arbitrary Weight Changes in Dynamic Trees
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/04
  381. Codes: Unequal Probabilities, Unequal Letter Cost
    Doris Altenkamp and Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-78): 5th international colloquium, Udine, Italy, 1978, 15-25
  382. Codes: Unequal Probabilities, Unequal Letter Cost
    Doris Altenkamp and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/18
  383. Codes: Unequal Probabilities, Unequal Letter Cost
    Doris Altenkamp and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/18
  384. Complexity Arguments in Algebraic Language Theory
    Helmut Alt and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/10
  385. Effiziente Algorithmen: Ein Beispiel
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/02
  386. Effiziente Algorithmen: Ein Beispiel
    Kurt Mehlhorn
    Informatik Spektrum 1 (2): 81-89, 1978

  387. On the Average Number of Rebalancing Operations in Weight-Balanced Trees
    Norbert Blum and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/06
  388. Sorting Presorted Files
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 78/12
  389. A best possible bound for the weighted path length of binary search trees
    Kurt Mehlhorn
    SIAM Journal on Computing 6 (2): 235-239, 1977
    [PDF: Download: Mehlhorn_a_1977_a.pdf]
  390. Dynamic Binary Search
    Kurt Mehlhorn
    In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), Turku, Finland, 1977, 323-336
  391. Effiziente Algorithmen
    Kurt Mehlhorn
    , Teubner, Stuttgart, 1977, 233 p.
  392. Van Wijngaarden Grammars and Space Complexity Class EXSPACE
    Peter Deussen and Kurt Mehlhorn
    Acta Informatica 8 (2): 193-199, 1977
    [PDF: Download: Mehlhorn_a_1976_d.pdf]
  393. An improved lower bound on the formula complexity of context-free recognition
    Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, A 76/??
  394. An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
    Kurt Mehlhorn
    Elektronische Informationsverarbeitung und Kybernetik 12 (11/12): 523-524, 1976
    [PDF: Download: Mehlhorn_1976_b_m.pdf]
  395. An O(n log n) lower bound for the synchronous circuit size of integer multiplication
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/06
  396. Binary Search Trees: Average and Worst Case Behavior
    Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, and Norbert Wernet
    In: GI - 6. Jahrestagung, Stuttgart, Germany, 1976, 301-313
  397. Binary Search Trees: Average and Worst Case Behavior
    Reiner Güttler, Kurt Mehlhorn, and Wolfgang Schneider
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/01
  398. Bracket-languages are recognizable in logarithmic space
    Kurt Mehlhorn
    Information Processing Letters 5 (6): 168-170, 1976
    [PDF: Download: Mehlhorn_1976_f_m.pdf]
  399. Dynamic Binary Search
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/02
  400. Dynamic Binary Search Trees : Extended Abstracts
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/11
  401. Lower Bounds for the Space Complexity of Context-Free Recognition
    Helmut Alt and Kurt Mehlhorn
    In: Third International Colloquium on Automata, Languages and Programming, Edinburgh, UK, 1976, 338-354
    [PDF: Download: ICALP76.PDF]
  402. Monotone Switching Circuits and Boolean Matrix Product
    Kurt Mehlhorn and Zvi Galil
    Computing 16 (1--2): 99-111, 1976
    [PDF: Download: Mehlhorn_a_1976_j.pdf]
  403. Polynomial and abstract subrecursive classes
    Kurt Mehlhorn
    Journal of Computer and System Sciences 12 (2): 147-178, 1976. Note: preliminary = "STOC::Mehlhorn1974"
    [PDF: Download: Mehlhorn7.pdf]
  404. Top down parsing of macro grammars (preliminary report)
    Manfred Heydthausen and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 76/03
  405. Top Down Parsing of Macro Grammars
    Manfred Heydthausen and Kurt Mehlhorn
    In: GI - 6. Jahrestagung, Stuttgart, Germany, 1976, 95-108
  406. A game on graphs
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/16
  407. A Language over a One Symbol Alphabet Requiring only O(log log n) Space
    Helmut Alt and Kurt Mehlhorn
    SIGACT News 7 (4): 31-33, 1975
    [PDF: Download: Mehlhorn_a_1975_b.pdf]
  408. Best possible bounds for the weighted path length of optimum binary search trees
    Kurt Mehlhorn
    In: Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, Germany, 1975, 31-41
  409. Bracket-Languages are Recognizable in Logarithmic Space
    Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/12
  410. Monotone Switching Circuits and Boolean Matrix Product
    Kurt Mehlhorn and Zvi Galil
    In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, Mariánské Lázne, Czechoslovakia, 1975, 315-319
  411. Nearly Optimal Binary Search Trees
    Kurt Mehlhorn
    Acta Informatica 5 (4): 287-295, 1975
    [PDF: Download: Mehlhorn_a_1975_f.pdf]
  412. Untere Schranken für den Platzbedarf bei der kontext-freien Analyse
    Helmut Alt and Kurt Mehlhorn
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 75/13
  413. Polynomial and abstract subrecursive classes
    Kurt Mehlhorn
    Doctoral dissertation, Cornell University, 1974
    [PDF: Download: Mehlhorn_a_1974_a.pdf]
  414. Polynomial and abstract subrecursive classes
    Kurt Mehlhorn
    Department of Computer Science, Cornell University, Ithaca, 74-198
  415. Polynomial and Abstract Subrecursive Classes
    Kurt Mehlhorn
    In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), Seattle, Washington, USA, 1974, 96-109
    [PDF: Download: Mehlhorn_a_1974_a.pdf]
  416. The 'almost all' theory of subrecursive degrees is decidable
    Kurt Mehlhorn
    In: Automata, languages and programming : 2nd colloquium (ICALP-74), Saarbrücken, Germany, September, 22-23, 1974, 317-325
    [PDF: Download: Mehlhorn_1974_d_m.pdf]
  417. On the Size of Sets of Computable Functions
    Kurt Mehlhorn
    Department of Computer Science, Cornell University, Ithaca, 73-164
  418. On the Size of Sets of Computable Functions
    Kurt Mehlhorn
    In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), Iowa City, Iowa, USA, 1973, 190-196
    [PDF: Download: Mehlhorn_1973_a_m.pdf]
  419. The "almost all" theory of subrecursive degrees is decidable
    Kurt Mehlhorn
    Department of Computer Science, Cornell University, Ithaca, 74-170