Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations.
Michael FuchsPublished in: Comb. Probab. Comput. (2008)
Keyphrases
- binary search trees
- search tree
- closed form
- kd trees
- data structure
- parallel algorithm
- upper bound
- lower bound
- approximation methods
- branch and bound algorithm
- closed form expressions
- tree structure
- search space
- b tree
- linear functions
- search algorithm
- data management
- iterative refinement
- variance reduction
- poisson process
- sat solvers
- databases