Dynamic data structures

Kurt Mehlhorn
Mathematical Centre Tracts 108 71 -96

10
1979
A Descartes Algorithms for Polynomials with Bit-Stream Coefficients

Arno Eigenwillig , Kurt Mehlhorn , Lutz Kettner , Nicola Wolpert
dagstuhl seminar proceedings 0

17
2006
Certifying Algorithms (A Paper under Construction)

Kurt Mehlhorn , Arno Eigenwillig , Kanela Kanegossi , Dieter Kratsch

3
2005
37
1984
Fair Matchings and Related Problems

Kurt Mehlhorn , Telikepalli Kavitha , Dimitrios Michail , Chien-Chung Huang
foundations of software technology and theoretical computer science 24 339 -350

3
2013
2013
On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs

Kurt Mehlhorn , M. Tsagarakis
Colloque de Lille 'les Arbres en Algebre et en Programmation'

1979
On BF-perfect graphs

Kurt Mehlhorn , Bernd H. Schmidt

1985
Physarum Computations (Invited talk)

Kurt Mehlhorn
symposium on theoretical aspects of computer science 20 5 -6

2013
Informatik 2000 : Neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatik

Kurt Mehlhorn , Gregor Snelting
30. Jahrestagung der Gesellschaft für Informatik

2000
Dynamic Binary Search Trees : Extended Abstracts

Kurt Mehlhorn
Fachbereich Informatik, Universität des Saarlandes

1976
A game on graphs

Kurt Mehlhorn

1975
Fundamentals - Foundations of Computer Science

Kurt Mehlhorn
Österreichische Computer Gesellschaft (OCG) / Austrian Computer Society

1
1998
Intersecting a line and a simple polygon

Kurt Mehlhorn , K Hoffmann
Eatcs Bulletin 22 120 -121

3
1984
Special issue on algorithms: implementation, libraries and use

Kurt Mehlhorn , Bruno Buchberger , Stefan Näher , Jurg Nievergelt
Journal of Symbolic Computation 17 ( 4)

1994
Local Routing of Two-terminal Nets is Easy

Kurt Mehlhorn , Michael Kaufmann
Universität des Saarlandes / Fachbereich Informatik

1
1984