( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Physarum Can Compute Shortest Paths

, , и . CoRR, (2011)

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.

Kurt Mehlhorn

Kurt Mehlhorn

Fritz Mehlhorn

Peter Mehlhorn

Hans Mehlhorn

 

Другие публикации лиц с тем же именем

Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens.. GI Jahrestagung, том 19 из Informatik-Fachberichte, стр. 16-22. Springer, (1979)Physarum Can Compute Shortest Paths, , и . CoRR, (2011)Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms, , и . CoRR, (2012)Towards an open online repository of P. polycephalum networks and their corresponding graph representations., , , , и . BICT, стр. 588. ICST/ACM, (2015)Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs., , , и . SIAM J. Comput., 36 (2): 326-353 (2006)Some Remarks on Boolean Sums.. MFCS, том 74 из Lecture Notes in Computer Science, стр. 375-380. Springer, (1979)From Algorithm to Program to Software Library.. Informatics, том 2000 из Lecture Notes in Computer Science, стр. 268-273. Springer, (2001)New Approximability Results for the Robust k-Median Problem., , , и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 50-61. Springer, (2014)Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, и . Inf. Control., 58 (1-3): 137-156 (июля 1983)Physarum can compute shortest paths., , и . SODA, стр. 233-240. SIAM, (2012)