Sciweavers

Share
SWAT
2010
Springer

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

9 years 3 months ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously.
Prosenjit Bose, Karim Douïeb, Vida Dujmovic,
Added 11 Jul 2010
Updated 11 Jul 2010
Type Conference
Year 2010
Where SWAT
Authors Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg
Comments (0)
books