Author of the publication

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.

, , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 91-102. Springer, (2015)

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 the adaptiveness of Quicksort., , and . ACM Journal of Experimental Algorithmics, (2008)Counting in the Presence of Memory Faults., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 842-851. Springer, (2009)Fault Tolerant External Memory Algorithms., , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 411-422. Springer, (2009)Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)., , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 26-37. Springer, (2014)Optimal Resilient Dynamic Dictionaries., , , , , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 347-358. Springer, (2007)Comparator Networks for Binary Heap Construction., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 158-168. Springer, (1998)Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees., and . ESA, volume 87 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Cache Oblivious Algorithms for Computing the Triplet Distance between Trees., and . ACM J. Exp. Algorithmics, (2021)Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree., , , , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 101-110. Imperial College Press, (2007)Selecting Sums in Arrays., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 100-111. Springer, (2008)