Login / Signup

The amortized complexity of non-blocking binary search trees.

Faith EllenPanagiota FatourouJoanna HelgaEric Ruppert
Published in: PODC (2014)
Keyphrases
  • binary search trees
  • data structure
  • parallel algorithm
  • search tree
  • worst case
  • computational complexity
  • kd trees
  • data mining
  • feature selection
  • search space
  • special case
  • b tree
  • branch and bound algorithm