Searching for "Dynamic Binary Search." – sorted by Relevance.
-
Binary Search Trees of Almost Optimal Height
- on the height of a dynamic binary search tree. By maintaining two trees simultaneously the amortized cost
- Cited by 12 (1 self) – Add To MetaCart
-
PREPRINT. Acta Informatica, 28:165-178, 1990. Binary Search Trees of Almost Optimal Height
- dynamic binary search tree. This is obtained by using a modified version of an SBB(k)-tree where we use a
- Add To MetaCart
-
Dynamic Length-Restricted Coding
- codes can be obtained from dynamic binary search trees. They can also be obtained from other dynamic
- Cited by 3 (2 self) – Add To MetaCart
-
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
- , just as efficient as any dynamic binary search tree, even one that knows the whole access sequence
- Cited by 2 (0 self) – Add To MetaCart
-
Cache Oblivious Search Trees via Binary Trees of Small Height
- .1 Insertions Let T denote the dynamic binary search tree, and let H be the upper bound on h(T ) we want
- Cited by 49 (8 self) – Add To MetaCart
-
Towards In-Place Geometric Algorithms and Data Structures
- algorithm. With more eort, Munro [25] showed how to implement a dynamic binary search tree inside an array
- Cited by 8 (3 self) – Add To MetaCart
-
A simplified and dynamic unified structure
- dynamic binary search tree for any given request sequence. This conjecture has motivated the study
- Cited by 7 (3 self) – Add To MetaCart
-
-Organizing Binary Search Trees
- approaches are biasing [8], dynamic binary search [26], weighted randomization [7], deepsplaying [33
- Add To MetaCart
-
Snap Rounding Line Segments Efficiently in Two and Three Dimensions
- of the boundary of h by the current segment as a dynamic binary search tree (such as a red-black tree
- Cited by 22 (1 self) – Add To MetaCart
-
Competitive online algorithms
- be extended to binary search trees. The most popular version of self-organizing binary search trees
- Cited by 19 (1 self) – Add To MetaCart

