An O(log log n)-competitive binary search tree with optimal worst-case access times

Authors:
Prosenjit Bose;Karim Douïeb;Vida Dujmović;Rolf Fagerberg
Affiliations:
School of Computer Science, Carleton University;School of Computer Science, Carleton University;School of Computer Science, Carleton University;Department of Mathematics and Computer Science, University of Southern Denmark
Venue:
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Year:
2010

Citing 11
Cited 2

Self-adjusting binary search trees

Journal of the ACM (JACM)
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
On the Competitiveness of Linear Search

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
O(log log n)-competitive dynamic binary search trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Multi-splay trees

Multi-splay trees
Dynamic Optimality—Almost

SIAM Journal on Computing
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying

Information Processing Letters
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The geometry of binary search trees

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Heterogeneous decomposition of degree-balanced search trees and its applications

Heterogeneous decomposition of degree-balanced search trees and its applications
Poketree: a dynamically competitive data structure with good worst-case performance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Upper bounds for maximally greedy binary search trees

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
De-amortizing binary search trees

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the zipper tree, an O(log log n)-competitive online binary search tree that performs each access in O(logn) 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.