( en | de | ru )

 

Disambiguation of "Fagerberg, Rolf"

Author of the publication

copydeleteadd this publication to your clipboard
Biased Predecessor Search.

, , , and . CoRR, (2017)

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.

Thomas Marten Rolfs

Anke Rolfes-Bußmann

Gerda Rolfes

Gabriele Rolfes

Christian Rolf

 

Other publications of authors with the same name

Competitive Local Routing with Constraints., , , and . CoRR, (2014)Continuous Yao graphs., , , , , , , , , and . Comput. Geom., (2018)Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model., , , , and . Theory Comput. Syst., 47 (4): 934-962 (2010)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)Funnel Heap - A Cache Oblivious Priority Queue., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 219-228. Springer, (2002)Efficient Rebalancing of B-Trees with Relaxed Balance., and . Int. J. Found. Comput. Sci., 7 (2): 169-186 (1996)Cache-Oblivious B-Tree.. Encyclopedia of Algorithms, Springer, (2008)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)A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees., , , , and . BMC Bioinform., 14 (S-2): S18 (2013)Balanced Binary Search Trees., , and . Handbook of Data Structures and Applications, Chapman and Hall/CRC, (2004)