Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version)

Robert E. Wilber

Published in: FOCS (1986)

Keyphrases

preliminary version
binary search trees
lower bound
search tree
branch and bound algorithm
data structure
parallel algorithm
upper bound
branch and bound
objective function
lower and upper bounds
np hard
b tree
optimal solution
vc dimension
worst case
data analysis
data mining
search space