Login / Signup

An Improved Bound for Random Binary Search Trees with Concurrent Insertions.

George GiakkoupisPhilipp Woelfel
Published in: STACS (2018)
Keyphrases
  • binary search trees
  • data structure
  • parallel algorithm
  • search tree
  • upper bound
  • worst case
  • lower bound
  • kd trees
  • databases
  • special case
  • r tree
  • b tree
  • insertions and deletions