Complexity of Layered Binary Search Trees with Relaxed Balance.

Lars Jacobsen Kim S. Larsen

Published in: ICTCS (2001)

Keyphrases

binary search trees
data structure
computational complexity
parallel algorithm
search tree
worst case
decision problems
data sets
databases
neural network
data mining
optimal solution
high dimensional
computational cost
upper bound
memory requirements