activity
20062023
most citedAn O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

6 citations · 10 across the 13 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.DS2011

De-amortizing Binary Search Trees

Prosenjit Bose, Sébastien Collette, Rolf Fagerberg +1

We present a general method for de-amortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the…