( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Refined Buneman Trees in Cubic Time.

, , , , и . WABI, том 2812 из Lecture Notes in Computer Science, стр. 259-270. Springer, (2003)

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.

Brigitte Rolfs

Max Rolfes

Albert Rolff

Joachim Rolf

Bernhard Rolf

 

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

Competitive Local Routing with Constraints., , , и . CoRR, (2014)A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees., , , , и . BMC Bioinform., 14 (S-2): S18 (2013)Funnel Heap - A Cache Oblivious Priority Queue., и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 219-228. Springer, (2002)On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?, , и . ISAAC, том 149 из LIPIcs, стр. 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model., , , , и . Theory Comput. Syst., 47 (4): 934-962 (2010)Continuous Yao graphs., , , , , , , , , и . Comput. Geom., (2018)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)Efficient Rebalancing of B-Trees with Relaxed Balance., и . Int. J. Found. Comput. Sci., 7 (2): 169-186 (1996)External String Sorting: Faster and Cache-Oblivious., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2006)