2 citations · 3 across the 10 of their papers we have counts for
Showing 2024 · cs.DSShow all
2 papers · 2 filters
cs.DS2024
Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
Gerth Stølting Brodal
Rebalancing schemes for dynamic binary search trees are numerous in the literature, where the goal is to maintain trees of low height, either in the worst-case or expected sense. I…
cs.DS2024
Deterministic Cache-Oblivious Funnelselect
Gerth Stølting Brodal, Sebastian Wild
In the multiple-selection problem one is given an unsorted array of elements and an array of query ranks , and the task is to return, in sorted order, t…