Login / Signup

Pinning down the Strong Wilber 1 Bound for Binary Search Trees.

Parinya ChalermsookJulia ChuzhoyThatchaphol Saranurak
Published in: APPROX-RANDOM (2020)
Keyphrases
  • binary search trees
  • data structure
  • parallel algorithm
  • search tree
  • upper bound
  • lower bound
  • high level
  • kd trees
  • database
  • b tree