161 search results - page 5 / 33 » Skewed Binary Search Trees |
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
CIAC
1994
Springer
13 years 11 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
ISCIS
2009
Springer
13 years 12 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
DAGSTUHL
2007
13 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...