Author of the publication

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

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 38-49. Springer, (2010)Cache-Oblivious B-Tree.. Encyclopedia of Algorithms, Springer, (2008)Funnel Heap - A Cache Oblivious Priority Queue., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 219-228. Springer, (2002)On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?, , and . ISAAC, volume 149 of LIPIcs, page 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)External String Sorting: Faster and Cache-Oblivious., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 68-79. Springer, (2006)On the limits of cache-obliviousness., and . STOC, page 307-315. ACM, (2003)Dynamic Representation of Sparse Graphs., and . WADS, volume 1663 of Lecture Notes in Computer Science, page 342-351. Springer, (1999)Binary Search Trees: How Low Can You Go?. SWAT, volume 1097 of Lecture Notes in Computer Science, page 428-439. Springer, (1996)On Plane Constrained Bounded-Degree Spanners., , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 85-96. Springer, (2012)Amortization Results for Chromatic Search Trees, with an Application to Priority Queues., , and . WADS, volume 955 of Lecture Notes in Computer Science, page 270-281. Springer, (1995)