Author of the publication

On Computing the Total Displacement Number via Weighted Motzkin Paths.

, , , , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 423-434. Springer, (2016)

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.

 

Other publications of authors with the same name

On Computing the Total Displacement Number via Weighted Motzkin Paths., , , , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 423-434. Springer, (2016)Optimal Dislocation with Persistent Errors in Subquadratic Time., , , and . STACS, volume 96 of LIPIcs, page 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Sorting by Swaps with Noisy Comparisons., , and . CoRR, (2018)Counting small cuts in a graph, and . CoRR, (2013)Parallel Minimum Cuts in Near-linear Work and Low Depth., and . ACM Trans. Parallel Comput., 8 (2): 8:1-8:20 (2021)Optimal Sorting with Persistent Comparison Errors., , , and . ESA, volume 144 of LIPIcs, page 49:1-49:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Optimal Dislocation with Persistent Errors in Subquadratic Time., , , and . Theory Comput. Syst., 64 (3): 508-521 (2020)Cache Oblivious Minimum Cut., and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 285-296. (2017)Parallel Minimum Cuts in Near-linear Work and Low Depth., and . SPAA, page 1-11. ACM, (2018)Dual-Mode Greedy Algorithms Can Save Energy., , , , and . ISAAC, volume 149 of LIPIcs, page 64:1-64:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)