Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 10:21, 19 May 2013

Search the publication database

  . Return

Your search returned the following 415 documents:

  1. Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, and Christine Rizkallah
    A Framework for the Verification of Certifying Computations
    . 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. Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Every DFS tree of a 3-connected graph contains a contractible edge
    Journal of Graph Theory 72 (1): 112-121, 2013
  3. Kurt Mehlhorn, Michael Sagraloff, and Pengming Wang
    From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
    arXiv abs/1301.4870, 2013. Note: A short version has been submitted to the International Symposium on Symbolic and Algebraic Computation (ISSAC)
  4. Tomasz Jurkiewicz and Kurt Mehlhorn
    The cost of address translation
    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).
  5. Ran Duan and Kurt Mehlhorn
    A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
    arXiv abs/1212.0979v1: 1-8, 2012
  6. Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
    Algorithmica 62 (3): 754-766, 2012
  7. Kurt Mehlhorn, Adrian Neumann, and Jens M. Schmidt
    Certifying 3-Edge-Connectivity
    . Note: Manuscript

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  62. Kurt Mehlhorn
    Reliable and Efficient Geometric Computing
    In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, Rome, Italy, 2006, 1-2
  63. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Reply to "Backward Error Analysis ..."
    In: Computational Science and Its Applications - ICCSA 2006, I, Glasgow, UK, 2006, 60-60
  64. Arno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, and Nicola Wolpert
    A Descartes algorithm for polynomials with bit-stream coefficients
    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]
  65. Telikepalli Kavitha and Kurt Mehlhorn
    A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
    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]
  66. Kurt Mehlhorn, Arno Eigenwillig, Kanela Kaligosi, Dieter Kratsch, Ross McConnell, Ulrich Meyer, and Jeremy P. Spinrad
    Certifying Algorithms (draft)
    . Note: draft
  67. Stefan Funke, Christian Klein, Kurt Mehlhorn, and Susanne Schmitt
    Controlled Perturbation for Delaunay Triangulations
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 1047-1056

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

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

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

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

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

  77. Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, and Peter Sanders
    Towards Optimal Multiple Selection
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 103-114
    [PDF: Download: Mehlhorn_a_2005_o.pdf]
  78. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    A Faster Algorithm for Minimum Cycle Basis of Graphs
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, 2004, 846-857
    [PDF: Download: 179.pdf] [PDF: Download: Mehlhorn178.pdf]
  79. 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
    An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-361200-01, Report
    [PDF: Download: ECG-TR-361200-01.pdf]
  80. G. Konidaris, Kurt Mehlhorn, and D.A. Shell
    An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons

    [PS: Download: Mehlhorn_a_2004_c_polyadj.ps]
  81. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Classroom Examples of Robustness Problems in Geometric Computations
    In: ESA 2004: 12th Annual European Symposium on Algorithms, Bergen, Norway, 2004, 702-713

  82. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Classroom Examples of Robustness Problems in Geometric Computations
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363100-01, Technical Report
  83. Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    Matching Algorithms Are Fast in Sparse Random Graphs
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 81-92

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

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

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

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

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

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

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

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

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

  97. Dieter Kratsch, Ross McConnell, Kurt Mehlhorn, and Jeremy P. Spinrad
    Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
    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]
  98. Kurt Mehlhorn and Michael Seel
    Infimaximal frames: A technique for making lines look like segments
    International Journal of Computational Geometry & Applications 13 (3): 241-255, 2003

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

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

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

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

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

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

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

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

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

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

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

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

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

  117. Kurt Mehlhorn, Stefan Meiser, and Ronald Rasch
    Furthest site abstract Voronoi diagrams
    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

  118. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
    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
  119. Ernst Althaus and Kurt Mehlhorn
    Traveling Salesman-Based Curve Reconstruction in Polynomial Time
    SIAM Journal on Computing 31 (1): 27-66, 2001
    [PDF: Download: Mehlhorn_a_2001_j.pdf] [PDF: Download: 143.pdf]
  120. Kurt Mehlhorn and Mark Ziegelmann
    CNOP - A Package for Constrained Network Optimization
    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]
  121. John Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, and Martin Vingron
    A polyhedral approach to sequence alignment problems
    Discrete Applied Mathematics 104 (1/3): 143-186, 2000

  122. Alexander Koller, Kurt Mehlhorn, and Joachim Niehren
    A Polynomial-Time Fragment of Dominance Constraints
    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]
  123. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
    A strong and easily computable separation bound for arithmetic expressions involving radicals
    Algorithmica 27 (1): 87-99, 2000

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

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

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

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

  130. Kurt Mehlhorn and Stefan Schirra
    Geometric Computing with CGAL and LEDA
    In: Curve and surface design, Saint-Malo 1999, Saint-Malo, France, July 1, - July 7, 2000, 277-286
    [PDF: Download: 146.pdf]
  131. Kurt Mehlhorn and Guido Schäfer
    Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
    In: 4th International Workshop on Algorithm Engineering, Saarbrücken, Germany, September, 5-8, 2000, 23-38
    [PDF: Download: 154.pdf]
  132. Stefan Funke and Kurt Mehlhorn
    LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
    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]
  133. Kurt Mehlhorn and Mark Ziegelmann
    Resource Constrained Shortest Paths
    In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), Saarbrücken, Germany, September, 5-8, 2000, 326-337

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

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

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

  142. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    I/O-optimal computation of segment intersections
    In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, May 20-22, 1998, 1999, 131-138
  143. Andreas Crauser and Kurt Mehlhorn
    LEDA-SM : Extending LEDA to Secondary Memory
    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]
  144. Kurt Mehlhorn and Stefan Näher
    LEDA: a platform for combinatorial and geometric computing
    , Cambridge University Press, Cambridge, 1999, 1018 p.
  145. Sunil Arya, Mordecai J. Golin, and Kurt Mehlhorn
    On the Expected Depth of Random Circuits
    Combinatorics, Probability and Computing 8 (209-228): 209-228, 1999
  146. Stefan Funke, Kurt Mehlhorn, and Stefan Näher
    Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
    In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), Vancouver, Canada, August, 15-18, 1999, 39-42

  147. Kurt Mehlhorn
    Ten Years of LEDA Some Thoughts (Abstract)
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, London, UK, May 20-22, 1998, 1999, 14-14
  148. Kurt Mehlhorn
    The Engineering of Some Bipartite Matching Programs
    In: Algorithms and computation : 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999, 1999, 1-3
  149. Kurt Mehlhorn
    The Engineering of Some Bipartite Matching Programs
    In: Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 16-18, 1999, 1999, 446-449
  150. Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, and Joachim Ziegler
    A computational basis for higher-dimensional computational geometry and applications
    Computational Geometry: Theory and Applications 10 (4): 289-304, 1998
  151. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
    A Parallelization of Dijkstra's Shortest Path Algorithm
    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

  152. Kurt Mehlhorn
    Amortisierte Analyse
    In: Prinzipien des Algorithmenentwurfs, 1998, 91-102
    [PDF: Download: mehlhorn120.pdf]
  153. Kurt Mehlhorn and Stefan Näher
    From Algorithms to Working Programs on the Use of Program Checking in LEDA
    In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, Vienna, Austria and Budapest, Hungary, August 20-22, 1998, 81-88
  154. Kurt Mehlhorn and Stefan Näher
    From Algorithms to Working Programs: On the Use of Program Checking in LEDA
    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]
  155. Ernst Althaus and Kurt Mehlhorn
    Maximum Network Flow with Floating Point Arithmetic
    Information Processing Letters 66 (3): 109-113, 1998

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  363. Kurt Mehlhorn and Mark H. Overmars
    Optimal dynamization of decomposable searching problems
    Universität des Saarlandes, Saarbrücken, A 80/15
  364. Kurt Mehlhorn
    Pebbling Mountain Ranges and its Application of DCFL-Recognition
    In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, Noordwijkerhout, The Netherlands, 1980, 422-435
    [PDF: Download: Mehlhorn.pdf]
  365. Helmut Alt and Kurt Mehlhorn
    Complexity arguments in algebraic language theory
    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

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

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

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

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

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

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

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