Login / Signup
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
Prosenjit Bose
Karim Douïeb
Vida Dujmovic
Rolf Fagerberg
Published in:
CoRR (2010)
Keyphrases
</>
binary search trees
worst case
data structure
average case
parallel algorithm
search tree
lower bound
worst case analysis
error bounds
upper bound
greedy algorithm
dynamic programming
approximation algorithms
b tree
optimal solution
learning algorithm
database