dblp.uni-trier.dewww.uni-trier.de

Kurt Mehlhorn Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page - Biographical Citations

*2009
287EEEdoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi: Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312
286EEKurt Mehlhorn: Assigning Papers to Referees. ICALP (1) 2009: 1-2
285EEChristoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt: A Separation Bound for Real Algebraic Expressions. Algorithmica 55(1): 14-28 (2009)
2008
284 Dan Halperin, Kurt Mehlhorn: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings Springer 2008
283 Kurt Mehlhorn, Peter Sanders: Algorithms and Data Structures: The Basic Toolbox. Springer 2008
282EEArno Eigenwillig, Kurt Mehlhorn: Multiplikation langer Zahlen (schneller als in der Schule). Taschenbuch der Algorithmen 2008: 109-118
281EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52(3): 333-349 (2008)
280EELutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008)
279EERamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008)
2007
278EEKurt Mehlhorn: Matchings in Graphs Variations of the Problem. COCOA 2007: 1-2
277EEEric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein: Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. ESA 2007: 645-656
276EEKurt Mehlhorn: Minimum Cycle Bases in Graphs Algorithms and Applications. MFCS 2007: 13-14
275EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail: New Approximation Algorithms for Minimum Cycle Bases of Graphs. STACS 2007: 512-523
274EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Transactions on Algorithms 3(2): (2007)
273EEPeter Hachenberger, Lutz Kettner, Kurt Mehlhorn: Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Comput. Geom. 38(1-2): 64-99 (2007)
272EECraig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, Evangelia Pyrga: Cycle bases of graphs and sampled manifolds. Computer Aided Geometric Design 24(8-9): 464-480 (2007)
271EEDavid J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular Matchings. SIAM J. Comput. 37(4): 1030-1045 (2007)
270EETelikepalli Kavitha, Kurt Mehlhorn: Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007)
2006
269EEKurt Mehlhorn: Reliable and Efficient Geometric Computing. CIAC 2006: 1-2
268EEKurt Mehlhorn: Reliable and Efficient Geometric Computing. ESA 2006: 2
267EERamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261
266EEKurt Mehlhorn, Ralf Osbild, Michael Sagraloff: Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) 2006: 299-310
265EELutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60
264EEKurt Mehlhorn: Reliable Geometric Computing. OR 2006: 111
263EEKurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithms for Polynomials with Bit-Stream Coefficients. Reliable Implementation of Real Number Algorithms 2006
262EEKurt Mehlhorn, Dimitrios Michail: Implementing minimum cycle basis algorithms. ACM Journal of Experimental Algorithmics 11: (2006)
261EERobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. ACM Transactions on Algorithms 2(4): 602-610 (2006)
260EEBoris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006)
259EEWerner Krandick, Kurt Mehlhorn: New bounds for the Descartes method. J. Symb. Comput. 41(1): 49-66 (2006)
258EEDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006)
257EEHolger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006)
2005
256 Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005
255EEArno Eigenwillig, Lutz Kettner, Werner Krandick, Kurt Mehlhorn, Susanne Schmitt, Nicola Wolpert: A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. CASC 2005: 138-149
254EEEric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert: EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166
253EEKurt Mehlhorn: Minimum Cycle Bases and Surface Reconstruction. Graph Drawing 2005: 532-532
252EEKanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders: Towards Optimal Multiple Selection. ICALP 2005: 103-114
251EEDavid J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn: Pareto Optimality in House Allocation Problems. ISAAC 2005: 1163-1175
250EEStefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt: Controlled perturbation for Delaunay triangulations. SODA 2005: 1047-1056
249EEDavid J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn: Popular matchings. SODA 2005: 424-432
248EESurender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie: New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681
247EETelikepalli Kavitha, Kurt Mehlhorn: A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. STACS 2005: 654-665
246EEKurt Mehlhorn, Dimitrios Michail: Implementing Minimum Cycle Basis Algorithms. WEA 2005: 32-43
245EEStefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3): 179-194 (2005)
2004
244EELars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004
243EELutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713
242EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857
241EEDavid J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn: Pareto Optimality in House Allocation Problems. ISAAC 2004: 3-15
240EEBoris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88
239EERobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Rank-maximal matchings. SODA 2004: 68-75
238EEErnst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn: Point containment in the integer hull of a polyhedron. SODA 2004: 929-933
237EETelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch: Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS 2004: 222-233
236EEHolger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92
2003
235EEKurt Mehlhorn: The Reliable Algorithmic Software Challenge RASC. Computer Science in Perspective 2003: 255-263
234EEMiguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel: Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. ESA 2003: 654-666
233EECyril Banderier, René Beier, Kurt Mehlhorn: Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207
232EEDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167
231EEMarcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber: Certifying and repairing solutions to large LPs how good are LP-solvers? SODA 2003: 255-256
230EEKurt Mehlhorn: The Reliable Algorithmic Software Challenge RASC. WEA 2003: 222
229EEKurt Mehlhorn, Peter Sanders: Scanning Multiple Sequences Via Cache Memory. Algorithmica 35(1): 75-93 (2003)
228EEHolger Bast, Kurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003)
227EEStephen Kwek, Kurt Mehlhorn: Optimal search for rationals. Inf. Process. Lett. 86(1): 23-26 (2003)
226EEKurt Mehlhorn, Michael Seel: Infimaximal Frames: A Technique for Making Lines Look Like Segments. Int. J. Comput. Geometry Appl. 13(3): 241-255 (2003)
225EEErnst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel: An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003)
2002
224EEEric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer: A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA 2002: 174-186
223EEKurt Mehlhorn, Ulrich Meyer: External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735
222EEErnst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn: SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87
221EEKurt Mehlhorn, Guido Schäfer: Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. ACM Journal of Experimental Algorithmics 7: 4 (2002)
220 Stefan Funke, Kurt Mehlhorn: LOOK: A Lazy Object-Oriented Kernel design for geometric computation. Comput. Geom. 22(1-3): 99-118 (2002)
219EEKurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan: All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81(6): 341-343 (2002)
2001
218EEKurt Mehlhorn, Mark Ziegelmann: CNOP - A Package for Constrained Network Optimization. ALENEX 2001: 17-31
217EEKurt Mehlhorn, Guido Schäfer: A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ESA 2001: 242-253
216EEChristoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt: A Separation Bound for Real Algebraic Expressions. ESA 2001: 254-265
215 Kurt Mehlhorn: Exact geometric computation. HERCMA 2001: 87
214EEKurt Mehlhorn: From Algorithm to Program to Software Library. Informatics 2001: 268-273
213EEErnst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel: An efficient algorithm for the configuration problem of dominance graphs. SODA 2001: 815-824
212 Kurt Mehlhorn, Stefan Schirra: Exact Computation with leda_real - Theory and geometric Applications. Symbolic Algebraic Methods and Verification Methods 2001: 163-172
211 Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001)
210 Kurt Mehlhorn, Stefan Meiser, Ronald Rasch: Furthest Site Abstract Voronoi Diagrams. Int. J. Comput. Geometry Appl. 11(6): 583-616 (2001)
209EEErnst Althaus, Kurt Mehlhorn: Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM J. Comput. 31(1): 27-66 (2001)
2000
208EEAlexander Koller, Kurt Mehlhorn, Joachim Niehren: A Polynomial-Time Fragment of Dominance Constraints. ACL 2000
207EEKurt Mehlhorn, Guido Schäfer: Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. Algorithm Engineering 2000: 23-38
206EEKurt Mehlhorn, Sven Thiel: Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. CP 2000: 306-319
205EEKurt Mehlhorn, Mark Ziegelmann: Resource Constrained Shortest Paths. ESA 2000: 326-337
204EEKurt Mehlhorn: Constraint Programming and Graph Algorithms. ICALP 2000: 571-575
203EEErnst Althaus, Kurt Mehlhorn: TSP-based curve reconstruction in polynomial time. SODA 2000: 686-695
202EEStefan Funke, Kurt Mehlhorn: Look - a Lazy Object-Oriented Kernel for geometric computation. Symposium on Computational Geometry 2000: 156-165
201EEChristoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000)
200 Tamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4): 229-244 (2000)
199 Kurt Mehlhorn, Jörg-Rüdiger Sack: Editorial. Comput. Geom. 17(1-2): 1-2 (2000)
198 John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104(1-3): 143-186 (2000)
197 Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)
1999
196 Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press 1999
195EEKurt Mehlhorn: Ten Years of LEDA Some Thoughts (Abstract). Algorithm Engineering 1999: 14
194EEAndreas Crauser, Kurt Mehlhorn: LEDA-SM Extending LEDA to Secondary Memory. Algorithm Engineering 1999: 229-243
193EEStefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: A paradigm for efficient and exact geometric programs. CCCG 1999
192EEKurt Mehlhorn: The Engineering of some Bipartite Matching Programs. FSTTCS 1999: 446-449
191EEKurt Mehlhorn: The Engineering of Some Bipartite Matching Programs. ISAAC 1999: 1-3
190EEUlrich Finkler, Kurt Mehlhorn: Checking Priority Queues. SODA 1999: 901-902
189EETamal K. Dey, Kurt Mehlhorn, Edgar A. Ramos: Curve Reconstruction: Connecting Dots with Good Reason. Symposium on Computational Geometry 1999: 197-206
188EEChristoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: Efficient Exact Geometric Computation Made Easy. Symposium on Computational Geometry 1999: 341-350
187 Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig: Checking geometric programs or verification of geometric structures. Comput. Geom. 12(1-2): 85-103 (1999)
186 Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia: Editorial. Comput. Geom. 12(3-4): 153-154 (1999)
185EEJoseph Cheriyan, Kurt Mehlhorn: An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. Inf. Process. Lett. 69(5): 239-242 (1999)
184EESrinivasa Rao Arikati, Kurt Mehlhorn: A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999)
1998
183 Kurt Mehlhorn: Fundamentals - Foundations of Computer Science, IFIP World Computer Congress 1998, August 31 - September 4, 1998, Vienna/Austria and Budapest/Hungary Austrian Computer Society 1998
182 Kurt Mehlhorn: Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings Max-Planck-Institut für Informatik 1998
181 Kurt Mehlhorn, Stefan Näher: From Algorithms to Working Programs on the Use of Program Checking in LEDA. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 81-88
180EEAndreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731
179EEKurt Mehlhorn, Stefan Näher: From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS 1998: 84-93
178EEAndreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Some Geometric Problems. Symposium on Computational Geometry 1998: 259-268
177 Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler: A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. 10(4): 289-303 (1998)
176EEErnst Althaus, Kurt Mehlhorn: Maximum Network Flow with Floating Point Arithmetic. Inf. Process. Lett. 66(3): 109-113 (1998)
1997
175EEKurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16
174 Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe: Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM 1997: 15-26
173EEKnut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu: A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250
172 Ulrich Finkler, Kurt Mehlhorn: Runtime Prediction of Real Programs on Real Machines. SODA 1997: 380-389
171 Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra: A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709
170EEKurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap: A Complete Roundness Classification Procedure. Symposium on Computational Geometry 1997: 129-138
169EEKurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler: A Computational Basis for Higher-Dimensional Computational Geometry and Applications. Symposium on Computational Geometry 1997: 254-263
168 Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997)
167 Kurt Mehlhorn, Volker Priebe: On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997)
1996
166 Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50
165EEKurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig: Checking Geometric Programs or Verification of Geometric Structures. Symposium on Computational Geometry 1996: 159-165
164 Kurt Mehlhorn: Position Paper for Panel Discussion. WACG 1996: 51-52
163 Joseph Cheriyan, Kurt Mehlhorn: Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15(6): 521-549 (1996)
162 Kurt Mehlhorn, Petra Mutzel: On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996)
161 Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996)
160 Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996)
1995
159EEKurt Mehlhorn, Volker Priebe: On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. ESA 1995: 185-198
158EEChristoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19
157 Kurt Mehlhorn: Experiences with the Implementation of Geometric Algorithms (Abstract). WADS 1995: 518
156 Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995)
155 Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38(1): 96-102 (1995)
154 Kurt Mehlhorn: Guest Editor's Foreword. Discrete & Computational Geometry 14(4): 363-363 (1995)
153 Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Communication-Randomness Tradeoff for Two-Processor Systems Inf. Comput. 116(2): 155-161 (1995)
1994
152EEChristoph Burnikel, Kurt Mehlhorn, Stefan Schirra: How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA 1994: 227-239
151 Kurt Mehlhorn, Stefan Näher: The Implementation of Geometric Algorithms. IFIP Congress (1) 1994: 223-231
150 Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra: On Degeneracy in Geometric Computations. SODA 1994: 16-23
149 Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. SODA 1994: 213-222
148 Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994)
147 Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn: Dynamic Point Location in General Subdivisions. J. Algorithms 17(3): 342-380 (1994)
146 Michael Kaufmann, Kurt Mehlhorn: A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs. SIAM J. Comput. 23(2): 227-246 (1994)
145 Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23(4): 738-761 (1994)
1993
144EEDevdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel: Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS 1993: 436-443
143EETorben Hagerup, Kurt Mehlhorn, J. Ian Munro: Maintaining Discrete Probability Distributions Optimally. ICALP 1993: 253-264
142 Kurt Mehlhorn, Volker Claus, Wolfgang Thomas: Komplexitätstheorie und Algorithmik. Perspektiven der Informatik 1993: 113-116
141 Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig: Lower Bounds for Set Intersection Queries. SODA 1993: 194-201
140EELudek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker: Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS 1993: 317-322
139 Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec: A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. WADS 1993: 314-324
138 Rolf Klein, Kurt Mehlhorn, Stefan Meiser: Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. 3: 157-184 (1993)
137 Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)
136 Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993)
135EEKurt Mehlhorn, Athanasios K. Tsakalidis: Dynamic Interpolation Search. J. ACM 40(3): 621-634 (1993)
1992
134 Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig: Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43
133EEKurt Mehlhorn: Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). FSTTCS 1992: 404
132 Kurt Mehlhorn, Stefan Näher: Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) 1992: 493-505
131EEHanna Baumgarten, Hermann Jung, Kurt Mehlhorn: Dynamic Point Location in General Subdivisions. SODA 1992: 250-258
130EEKurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93
129EEKenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474
128 Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992)
127 Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992)
126 Kurt Mehlhorn, Wolfgang J. Paul, Christian Uhrig: k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs Inf. Comput. 101(1): 123-129 (1992)
125 Helmut Alt, Viliam Geffert, Kurt Mehlhorn: A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992)
124EEMichael Kaufmann, Kurt Mehlhorn: On local routing of two-terminal nets. J. Comb. Theory, Ser. B 55(1): 33-72 (1992)
1991
123 Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing: On the Construction of Abstract Voronoi Diagrams. Discrete & Computational Geometry 6: 211-224 (1991)
122 Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul: Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37(4): 237-240 (1991)
121 Kurt Mehlhorn, Chee-Keng Yap: Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991)
1990
120 Stefan Näher, Kurt Mehlhorn: LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) 1990: 35-39
119EEStefan Näher, Kurt Mehlhorn: LEDA: A Library of Efficient Data Types and Algorithms. ICALP 1990: 1-5
118EEJoseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248
117EERolf Klein, Kurt Mehlhorn, Stefan Meiser: On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms 1990: 138-154
116EEKurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing: On the Construction of Abstract Voronoi Diagrams. STACS 1990: 227-239
115EERudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: On Simultaneous Inner and Outer Approximation of Shapes. Symposium on Computational Geometry 1990: 216-224
114EEHelmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Symposium on Computational Geometry 1990: 281-289
113EERudolf Fleischer, Hermann Jung, Kurt Mehlhorn: A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401
112 Kurt Mehlhorn, Athanasios K. Tsakalidis: Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 301-342
111 Kurt Mehlhorn, Stefan Näher: Dynamic Fractional Cascading. Algorithmica 5(2): 215-241 (1990)
110EEKurt Mehlhorn, Stefan Näher: A faster compaction algorithm with automatic jog insertion. IEEE Trans. on CAD of Integrated Circuits and Systems 9(2): 158-166 (1990)
109EEKurt Mehlhorn, Wolfgang Rülling: Compaction on the torus [VLSI layout]. IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 389-397 (1990)
108 Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid: Dynamic Deferred Data Structuring. Inf. Process. Lett. 35(1): 37-40 (1990)
107 Kurt Mehlhorn, Stefan Näher, Christian Uhrig: Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990)
106 Kurt Mehlhorn, Stefan Näher: Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. 35(4): 183-189 (1990)
105EERavindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan: Faster Algorithms for the Shortest Path Problem J. ACM 37(2): 213-223 (1990)
104 Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990)
1989
103EEJacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm: Foundations of Programming Languages John Wiley 1989
102 Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem FOCS 1989: 546-548
101EEKurt Mehlhorn, Wolfgang J. Paul: Two Versus One Index Register and Modifiable Versus Non-modifiable Programs. ICALP 1989: 603-609
100EEKurt Mehlhorn, Stefan Näher: LEDA: A Library of Efficient Data Types and Algorithms. MFCS 1989: 88-106
99 Martin Fürer, Kurt Mehlhorn: AT²-Optimal Galois Field Multiplier for VLSI. IEEE Trans. Computers 38(9): 1333-1336 (1989)
1988
98 Kurt Mehlhorn, Wolfgang Rülling: Compaction on the Torus. AWOC 1988: 212-225
97 Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds FOCS 1988: 524-531
96 Kurt Mehlhorn, Gerhard Zimmermann: SFB 124: VLSI-Entwurfsmethoden und Parallelität. GI Jahrestagung (2) 1988: 3-29
95EEKurt Mehlhorn, Chee-Keng Yap: Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423
94EEMartin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert: Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215
93EEShaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling: On Continuous Homotopic One Layer Routing. Symposium on Computational Geometry 1988: 392-402
92 Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum: On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry 1988: 55-70
91 Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)
90 Kurt Mehlhorn: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. 27(3): 125-128 (1988)
89EEHermann Jung, Kurt Mehlhorn: Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. 27(5): 227-236 (1988)
88 Kurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988)
1987
87 Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn: Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings Springer 1987
86EEKurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488
85 Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15
84EEMichael Kaufmann, Kurt Mehlhorn: On Local Routing of Two-Terminal Nets. STACS 1987: 40-52
83EEHelmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315
82 Kurt Mehlhorn, Franco P. Preparata: Area-Time Optimal Division for T=Omega((log n)^1+ epsilon) Inf. Comput. 72(3): 270-282 (1987)
81 Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis: A log log n Data Structure for Three-Sided Range Queries. Inf. Process. Lett. 25(4): 269-273 (1987)
80 Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987)
1986
79 Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis: VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings Springer 1986
78EEJacques Loeckx, Kurt Mehlhorn, Reinhard Wilhelm: Grundlagen der Programmiersprachen Teubner 1986
77 Martin Fürer, Kurt Mehlhorn: AT2-Optimal Galois Field Multiplier for VLSI. Aegean Workshop on Computing 1986: 217-225
76EEHelmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. MFCS 1986: 199-208
75EEKurt Mehlhorn, Franco P. Preparata: Area-time Optimal Division for T=Omega(log n)1+epsilon STACS 1986: 341-352
74 Michael Becker, Kurt Mehlhorn: Algorithms for Routing in Planar Graphs. Acta Inf. 23(2): 163-176 (1986)
73 Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh: Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1(2): 213-221 (1986)
72 Kurt Mehlhorn: Über Verdrahtungsalgorithmen. Informatik Spektrum 9(4): 227-234 (1986)
71 Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan: Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees Information and Control 68(1-3): 170-184 (1986)
70EEKurt Mehlhorn, Franco P. Preparata: Routing through a rectangle. J. ACM 33(1): 60-85 (1986)
69 Michael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. J. Algorithms 7(4): 510-531 (1986)
68 Kurt Mehlhorn, Athanasios K. Tsakalidis: An Amortized Analysis of Insertions into AVL-Trees. SIAM J. Comput. 15(1): 22-33 (1986)
1985
67 Kurt Mehlhorn: STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings Springer 1985
66 Kurt Mehlhorn, Klaus Simon: Intersecting two polyhedra one of which is convex. FCT 1985: 534-542
65EEMichael Kaufmann, Kurt Mehlhorn: Routing Through a Generalized Switchbox. ICALP 1985: 328-337
64EEKurt Mehlhorn, Athanasios K. Tsakalidis: Dynamic Interpolation Search. ICALP 1985: 424-434
63 Heikki Mannila, Kurt Mehlhorn: A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 21(5): 269-272 (1985)
62 Stefan Hertel, Kurt Mehlhorn: Fast Triangulation of the Plane with Respect to Simple Polygons Information and Control 64(1-3): 52-76 (1985)
61 Helmut Alt, Kurt Mehlhorn: Searching Semisorted Tables. SIAM J. Comput. 14(4): 840-848 (1985)
1984
60EEKurt Mehlhorn: Data Structures and Algorithms 1: Sorting and Searching Springer 1984
59 Max Fontet, Kurt Mehlhorn: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings Springer 1984
58EEKurt Mehlhorn: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness Springer 1984
57EEKurt Mehlhorn: Data Structures and Algorithms 3 Springer 1984
56 Kurt Mehlhorn: On Optimal VLSI-Circuits for the Basic Arithmetic Functions. CAAP 1984: 23-30
55 Kurt Mehlhorn: Über Verdrahtungsalgorithmen. GI Jahrestagung (Fachgespräche) 1984: 79-89
54EEKurt Mehlhorn, Franco P. Preparata: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. ICALP 1984: 347-357
53 Kurt Mehlhorn, Uzi Vishkin: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Inf. 21: 339-374 (1984)
52 Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt: Space Sweep Solves Intersection of Convex Polyhedra. Acta Inf. 21: 501-519 (1984)
51 Helmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. Inf. Process. Lett. 19(2): 61-65 (1984)
1983
50 Stefan Hertel, Kurt Mehlhorn: Fast Triangulation of Simple Polygons. FCT 1983: 207-218
49 Kurt Mehlhorn, Bernd H. Schmidt: A Single Shortest Path Algorithm for Graphs with Separators. FCT 1983: 302-309
48 Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn, Rutger Verbeek: The Recognition of Deterministic CFL's in Small Time and Space Information and Control 56(1/2): 34-51 (1983)
47 Kurt Mehlhorn, Franco P. Preparata: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time Information and Control 58(1-3): 137-156 (1983)
46EEJia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Trade-offs in Graph Embeddings, with Applications J. ACM 30(4): 709-728 (1983)
1982
45 Kurt Mehlhorn: On the Program Size of Perfect and Universal Hash Functions FOCS 1982: 170-175
44 Kurt Mehlhorn, Erik Meineche Schmidt: Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) STOC 1982: 330-337
43 Scott Huddleston, Kurt Mehlhorn: A New Data Structure for Representing Sorted Lists. Acta Inf. 17: 157-184 (1982)
42 Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter: A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15(3): 135-136 (1982)
41 Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, 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)
40 Kurt Mehlhorn: A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM J. Comput. 11(4): 748-760 (1982)
1981
39EEJia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). ICALP 1981: 41-55
38EEHelmut Alt, Kurt Mehlhorn, J. Ian Munro: Partial Match Retrieval in Implicit Data Structures. MFCS 1981: 156-161
37EEScott Huddleston, Kurt Mehlhorn: Robust Balancing in B-Trees. Theoretical Computer Science 1981: 234-244
36 Kurt Mehlhorn: Arbitrary Weight Changes in Dynamic Trees. ITA 15(3): 183-211 (1981)
35 Kurt Mehlhorn, Mark H. Overmars: Optimal Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 12(2): 93-98 (1981)
34 Kurt Mehlhorn: Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures. Mathematical Systems Theory 15(1): 1-16 (1981)
1980
33EEKurt Mehlhorn: Pebbling Moutain Ranges and its Application of DCFL-Recognition. ICALP 1980: 422-435
32EEKurt Mehlhorn: A New Data Structure for Representing Sorted Lists. WG 1980: 90-112
31 Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider: Binary Search Trees: Average and Worst Case Behavior. Elektronische Informationsverarbeitung und Kybernetik 16(1-3): 41-61 (1980)
30EEDoris Altenkamp, Kurt Mehlhorn: Codes: Unequal Probabilities, Unequal Letter Cost. J. ACM 27(3): 412-427 (1980)
29 Norbert Blum, Kurt Mehlhorn: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11: 303-320 (1980)
1979
28 Kurt Mehlhorn: Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. GI Jahrestagung 1979: 16-22
27EEKurt Mehlhorn: Searching, Sorting and Information Theory. MFCS 1979: 131-145
26EEKurt Mehlhorn: Some Remarks on Boolean Sums. MFCS 1979: 375-380
25 Kurt Mehlhorn: Sorting Presorted Files. Theoretical Computer Science 1979: 199-212
24 Norbert Blum, Kurt Mehlhorn: Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science 1979: 67-78
23 Kurt Mehlhorn: Some Remarks on Boolean Sums. Acta Inf. 12: 371-375 (1979)
22 Helmut Alt, Kurt Mehlhorn: Complexity arguments in algebraic language theory. ITA 13(3): (1979)
21 Kurt Mehlhorn: Parsing Macro Grammars Top Down Information and Control 40(2): 123-143 (1979)
20 Kurt Mehlhorn: Dynamic Binary Search. SIAM J. Comput. 8(2): 175-198 (1979)
1978
19EEDoris Altenkamp, Kurt Mehlhorn: Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). ICALP 1978: 15-25
18 Kurt Mehlhorn: Effiziente Algorithmen: Ein Beispiel. Informatik Spektrum 1(2): 81-89 (1978)
1977
17 Kurt Mehlhorn: Effiziente Algorithmen Teubner 1977
16EEKurt Mehlhorn: Dynamic Binary Search. ICALP 1977: 323-336
15 Peter Deussen, Kurt Mehlhorn: Van Wijngaarden Grammars and Space Complexity Classs EXSPACE Acta Inf. 8: 193-199 (1977)
14 Kurt Mehlhorn: A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM J. Comput. 6(2): 235-239 (1977)
1976
13 Reiner Güttler, Kurt Mehlhorn, Wolfgang Schneider, Norbert Wernet: Binary Search Trees: Average and Worst Case Behavior. GI Jahrestagung 1976: 301-313
12 Manfred Heydthausen, Kurt Mehlhorn: Top Down Parsing of Macro Grammars. GI Jahrestagung 1976: 95-108
11 Helmut Alt, Kurt Mehlhorn: Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354
10EEKurt Mehlhorn, Zvi Galil: Monotone switching circuits and boolean matrix product. Computing 16(1-2): 99-111 (1976)
9 Kurt Mehlhorn: An Improved Lower Bound on the Formula Complexity of Context-free Recognition. Elektronische Informationsverarbeitung und Kybernetik 12(11/12): 523-524 (1976)
8 Kurt Mehlhorn: Bracket-Languages are Recognizable in Logarithmic Space. Inf. Process. Lett. 5(6): 168-170 (1976)
7 Kurt Mehlhorn: Polynomial and Abstract Subrecursive Classes. J. Comput. Syst. Sci. 12(2): 147-178 (1976)
1975
6 Kurt Mehlhorn: Best possible bounds for the weighted path length of optimum binary search trees. Automata Theory and Formal Languages 1975: 31-41
5EEKurt Mehlhorn, Zvi Galil: Monotone Switching Circuits and Boolean Matrix Product. MFCS 1975: 315-319
4 Kurt Mehlhorn: Nearly Optimal Binary Search Trees Acta Inf. 5: 287-295 (1975)
1974
3EEKurt Mehlhorn: The "Almost All" Theory of Subrecursive Degrees is Decidable. ICALP 1974: 317-325
2 Kurt Mehlhorn: Polynomial and Abstract Subrecursive Classes STOC 1974: 96-109
1973
1 Kurt Mehlhorn: On the Size of Sets of Computable Functions FOCS 1973: 190-196

Coauthor Index

1David J. Abraham [241] [249] [251] [271]
2Ravindra K. Ahuja [105]
3Andreas Alexander Albrecht [87]
4Helmut Alt [11] [22] [38] [51] [61] [76] [80] [83] [85] [86] [88] [91] [114] [122] [125] [127] [161]
5Doris Altenkamp [19] [30]
6Ernst Althaus [176] [203] [209] [213] [222] [225] [238]
7Edoardo Amaldi [287]
8Lars Arge [244] [256]
9Srinivasa Rao Arikati [184]
10Boris Aronov [240] [260]
11Tetsuo Asano [240] [260]
12Cyril Banderier [233]
13Hannah Bast (Holger Bast) [228] [236] [257]
14Surender Baswana [248]
15Hanna Baumgarten [131] [147]
16Michael Becker [42] [74]
17René Beier [233]
18Michael A. Bender [244] [256]
19Eric Berberich [224] [254] [277]
20Gianfranco Bilardi [148]
21Norbert Blum [24] [29] [122]
22Alexander Bockmayr [222]
23Burchard von Braunmühl [48]
24Christoph Burnikel [150] [152] [158] [171] [188] [201] [216] [285]
25Katarína Cechlárová [241] [251]
26Shiva Chaudhuri [148]
27Joseph Cheriyan [118] [160] [163] [185]
28Yu-Tai Ching [108]
29Kenneth L. Clarkson [129] [137]
30Volker Claus [142]
31Stephen Cook [48]
32Colin Cooper [174] [197]
33Andreas Crauser [178] [180] [194] [211]
34W. Degenhardt [42]
35Erik D. Demaine [244] [256]
36Peter Deussen [15]
37Tamal K. Dey [189] [200]
38Marcel Dhiflaoui [231]
39Paul F. Dietz [141] [156]
40Martin Dietzfelbinger [94] [97] [145]
41Katrin Dobrindt [139]
42Jürgen Doenhardt [42]
43Devdatt P. Dubhashi [144] [148]
44Denys Duchier [213] [225]
45Arno Eigenwillig [224] [254] [255] [263] [282]
46Bernhard Eisenbarth [41]
47Friedrich Eisenbrand [238]
48Matthias Elf [222]
49Paolo Ferragina [178] [211]
50Ulrich Finkler [172] [190]
51Rudolf Fleischer [113] [114] [115] [127] [128] [134] [153] [171] [188] [201]
52Efi Fogel [277]
53Max Fontet [59]
54Otfried Fries [81] [134]
55Alan M. Frieze [174] [197]
56Stefan Funke [193] [202] [216] [220] [231] [238] [245] [250] [285]
57Martin Fürer [77] [99]
58Zvi Galil [5] [10]
59Shaodi Gao [92] [93]
60Viliam Geffert [125]
61Gaston H. Gonnet [41]
62Craig Gotsman [272]
63Miguel Granados [234]
64Leonidas J. Guibas [161]
65Reiner Güttler [13] [31]
66Peter Hachenberger [234] [273]
67Torben Hagerup [76] [80] [85] [118] [143] [160]
68Dan Halperin [277] [284]
69Ramesh Hariharan [267] [279]
70Friedhelm Meyer auf der Heide [94] [97] [145]
71Michael Hemmer [224] [254]
72Monika Rauch Henzinger (Monika Rauch) [102] [104]
73Susan Hert [224] [234] [254]
74Stefan Hertel [42] [50] [52] [62]
75Manfred Heydthausen [12]
76Kurt Hoffman [71]
77Jia-Wei Hong [39] [46]
78Scott Huddleston [37] [43]
79Robert W. Irving [239] [249] [261] [271]
80Claudio Iuliano [287]
81Mark Jerrum [92] [93]
82Hermann Jung [87] [89] [113] [131] [147] [153]
83Michael Jünger [222]
84Tomasz Jurkiewicz [287]
85Kanela Kaligosi [252] [272]
86Gerd Kaninke [42]
87Anna R. Karlin [97] [145]
88Richard M. Karp [161]
89Thomas Kasper [222]
90Naoki Katoh [240] [260]
91Michael Kaufmann [65] [69] [84] [92] [93] [114] [124] [127] [146]
92Telikepalli Kavitha [237] [239] [242] [247] [248] [249] [261] [267] [270] [271] [274] [275] [279] [281]
93John D. Kececioglu [173] [198]
94W. Kerber [42]
95Lutz Kettner [234] [243] [254] [255] [263] [265] [273] [280]
96Christian Klein [250]
97Rolf Klein [117] [138]
98Alexander Koller [208] [213] [225]
99Jochen Könemann [158]
100Werner Krandick [255] [259] [263]
101Dieter Kratsch [232] [258]
102Ludek Kucera [140]
103Carsten Kwappik [231]
104Stephen Kwek [227]
105Charles E. Leiserson [244] [256]
106Hans-Peter Lenhof [173] [198]
107Jacques Loeckx [78] [103]
108Fillia Makedon [79]
109David Manlove [241] [251]
110Heikki Mannila [63]
111Martti Mäntylä [52]
112Ross M. McConnell [232] [258]
113Stefan Meiser [116] [117] [123] [134] [138] [210]
114Ulrich Meyer [178] [180] [211] [223]
115Dimitrios Michail [237] [239] [242] [246] [261] [262] [272] [274] [275] [281]
116Michael Müller [169] [177]
117J. Ian Munro [38] [51] [143] [252]
118Petra Mutzel [162] [173] [198]
119Stefan Näher [42] [81] [86] [88] [100] [102] [104] [106] [107] [110] [111] [114] [119] [120] [127] [132] [134] [151] [155] [158] [165] [166] [169] [175] [177] [179] [181] [187] [193] [196] [245]
120Joachim Niehren [208] [213] [225]
121Jürg Nievergelt [52]
122Colm Ó'Dúnlaing [116] [123]
123James B. Orlin [105]
124Ralf Osbild [266]
125Mark H. Overmars [35]
126Katarzyna E. Paluch [237] [239] [242] [261] [274] [281]
127Theodore S. Papatheodorou [79]
128Markus Paul [122]
129Wolfgang J. Paul [101] [126]
130Seth Pettie [248]
131Sylvain Pion [243] [265] [280]
132B. Preis [140]
133Franco P. Preparata [47] [54] [70] [73] [75] [76] [80] [82] [85]
134Volker Priebe [159] [167] [174] [197] [219]
135Evangelia Pyrga [272]
136Rajeev Raman [141] [156]
137Edgar A. Ramos [178] [189] [200] [211]
138Desh Ranjan [144]
139Ronald Rasch [210]
140Joachim Reichel [254]
141Knut Reinert [173] [198]
142Romeo Rizzi [287]
143Hans Rohnert [42] [94] [97] [134] [145]
144Arnold L. Rosenberg [39] [46]
145Pierre Rosenstiehl [71]
146Günter Rote [115] [128]
147Wolfgang Rülling [92] [93] [98] [109]
148Jörg-Rüdiger Sack [186] [199]
149Michael Sagraloff [266]
150Peter Sanders [180] [229] [252] [283]
151Majid Sarrafzadeh [73]
152Guido Schäfer [207] [217] [219] [221] [228] [236] [257]
153Thomas Schilz [165] [187]
154Stefan Schirra [114] [127] [134] [150] [152] [158] [165] [169] [171] [177] [187] [188] [201] [212] [216] [243] [265] [280] [285]
155Bernd H. Schmidt [49]
156Erik Meineche Schmidt [44]
157Susanne Schmitt [216] [250] [254] [255] [263] [285]
158Wolfgang Schneider [13] [31]
159Elmar Schömer [224] [231] [254]
160Ralph Schulte [231]
161E. Schwarzenecker [140]
162Michael Seel [165] [169] [177] [187] [226] [231] [234]
163Raimund Seidel [129] [137] [165] [187]
164Micha Sharir [130] [136]
165Thomas C. Shermer [170]
166Klaus Simon [66] [134]
167Naveen Sivadasan [219]
168Michiel H. M. Smid [108]
169Jeremy Spinrad [232] [258]
170Paul G. Spirakis [79]
171Christoph Storb [92]
172R. Sundar [149] [168]
173Hisao Tamaki [236] [257]
174Robert Endre Tarjan [71] [97] [105] [145]
175Christian Thiel [144]
176Sven Thiel [206] [213] [225]
177Wolfgang Thomas [142]
178Takeshi Tokuyama [240] [260]
179Athanasios K. Tsakalidis [64] [68] [81] [112] [134] [135]
180Christian Uhrig [107] [114] [126] [127] [134] [141] [149] [156] [158] [165] [166] [168] [169] [175] [177] [187]
181Jorge Urrutia [186]
182Rutger Verbeek [48]
183Martin Vingron [198]
184Uzi Vishkin [53]
185Hubert Wagener [83] [91]
186Dennis Weber [231]
187Ron Wein [277]
188Emo Welzl [83] [91] [115] [128] [130] [136]
189Norbert Wernet [13]
190Avi Wigderson [161]
191Reinhard Wilhelm [78] [103]
192Thomas Winter [42]
193Nicola Wolpert (Nicola Geismann) [254] [255] [263]
194Derick Wood [41]
195Chee-Keng Yap (Chee Yap) [95] [115] [121] [128] [170] [243] [265] [280]
196Mariette Yvinec [139]
197Mark Ziegelmann [205] [218]
198Joachim Ziegler [169] [177]
199Gerhard Zimmermann [96]
200Nivio Ziviani [41]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)