)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Prosenjit BoseKarim DouïebVida DujmovicRolf FagerbergPublished in: SWAT (2010)
Keyphrases
- binary search trees
- worst case
- data structure
- parallel algorithm
- upper bound
- np hard
- average case
- approximation algorithms
- error bounds
- worst case analysis
- lower bound
- constant factor
- computational complexity
- greedy algorithm
- optimal solution
- search tree
- space complexity
- access control
- running times
- search algorithm
- dynamic programming