Login / Signup
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees.
Parinya Chalermsook
Julia Chuzhoy
Thatchaphol Saranurak
Published in:
CoRR (2019)
Keyphrases
</>
binary search trees
data structure
parallel algorithm
search tree
upper bound
lower bound
worst case
data model
b tree
information retrieval
high dimensional
relational databases
special case
knn
language model
kd trees