( en | de | ru )

 

Disambiguation of "Mehlhorn, Kurt"

Author of the publication

copydeleteadd this publication to your clipboard
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" J. Symb. Comput. 45 (2010) 677-683.

, , and . J. Symb. Comput., (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

Achim Mehlhorn

Herbert 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)Physarum Can Compute Shortest Paths, , and . CoRR, (2011)Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms, , and . CoRR, (2012)Towards an open online repository of P. polycephalum networks and their corresponding graph representations., , , , and . BICT, page 588. ICST/ACM, (2015)Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs., , , and . SIAM J. Comput., 36 (2): 326-353 (2006)Some Remarks on Boolean Sums.. MFCS, volume 74 of Lecture Notes in Computer Science, page 375-380. Springer, (1979)From Algorithm to Program to Software Library.. Informatics, volume 2000 of Lecture Notes in Computer Science, page 268-273. Springer, (2001)New Approximability Results for the Robust k-Median Problem., , , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 50-61. Springer, (2014)Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, and . Inf. Control., 58 (1-3): 137-156 (July 1983)Physarum can compute shortest paths., , and . SODA, page 233-240. SIAM, (2012)