Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.

Gianni Franceschini Roberto Grossi

Published in: WADS (2003)

Keyphrases

worst case
search tree
binary search trees
search space
upper bound
search algorithm
lower bound
branch and bound algorithm
branching factor
np hard
root node
dynamic programming
main memory
database
b tree
optimal path
expected cost
tree search
computational complexity
data structure