( en | de | ru )

 

Disambiguation of "Mehlhorn, Kurt"

Author of the publication

copydeleteadd this publication to your clipboard
Multi-finger binary search trees.

, , , , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kurt Mehlhorn

Kurt Mehlhorn

Herbert Mehlhorn

Achim Mehlhorn

Johannes Mehlhorn

 

Other publications of authors with the same name

Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens.. GI Jahrestagung, volume 19 of Informatik-Fachberichte, page 16-22. Springer, (1979)Towards an open online repository of P. polycephalum networks and their corresponding graph representations., , , , and . BICT, page 588. ICST/ACM, (2015)Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms, , and . CoRR, (2012)Physarum Can Compute Shortest Paths, , and . CoRR, (2011)On the Implementation of Combinatorial Algorithms for the Linear Exchange Market.. Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 87-94. Springer, (2015)From Algorithm to Program to Software Library.. Informatics, volume 2000 of Lecture Notes in Computer Science, page 268-273. Springer, (2001)An o(n³)-Time Algorithm Maximum-Flow Algorithm., , and . SIAM J. Comput., 25 (6): 1144-1170 (1996)Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs., , and . Algorithmica, 1 (2): 213-221 (1986)Popular matchings., , , and . SODA, page 424-432. SIAM, (2005)Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs., , , and . SIAM J. Comput., 36 (2): 326-353 (2006)