( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
External String Sorting: Faster and Cache-Oblivious.

, , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2006)

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.

Horst Rolf

Christian Rolf

Gabriele Rolfes

Martin Wilhelm Rolf

Vera Rolf

 

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

Competitive routing in the half-θ6-graph., , , и . SODA, стр. 1319-1328. SIAM, (2012)Online Sorted Range Reporting., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 173-182. Springer, (2009)Dynamic Representation of Sparse Graphs., и . WADS, том 1663 из Lecture Notes in Computer Science, стр. 342-351. Springer, (1999)On the limits of cache-obliviousness., и . STOC, стр. 307-315. ACM, (2003)Amortization Results for Chromatic Search Trees, with an Application to Priority Queues., , и . WADS, том 955 из Lecture Notes in Computer Science, стр. 270-281. Springer, (1995)On Plane Constrained Bounded-Degree Spanners., , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2012)Binary Search Trees: How Low Can You Go?. SWAT, том 1097 из Lecture Notes in Computer Science, стр. 428-439. Springer, (1996)An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times., , , и . SWAT, том 6139 из Lecture Notes in Computer Science, стр. 38-49. Springer, (2010)Cache-Oblivious B-Tree.. Encyclopedia of Algorithms, Springer, (2008)Funnel Heap - A Cache Oblivious Priority Queue., и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 219-228. Springer, (2002)