Lower Bounds for Accessing Binary Search Trees with Rotations.
Robert E. WilberPublished in: SIAM J. Comput. (1989)
Keyphrases
- binary search trees
- lower bound
- data structure
- upper bound
- branch and bound algorithm
- search tree
- parallel algorithm
- branch and bound
- objective function
- np hard
- kd trees
- lower and upper bounds
- worst case
- dynamic programming
- decision trees
- b tree
- orders of magnitude
- special case
- optimal solution
- heuristic search
- linear programming
- vc dimension
- databases