Binary Search Trees of Bounded Balance

Cited In (56)

Updating approximately complete trees
Fibonacci BSTs: a new balancing method for binary search trees
Fast updating of well-balanced trees
Rank-Balanced Trees
Maintaining AUC and \(H\)-measure over time
Height balanced 2-3 trees
Dynamic weighted binary search trees
Efficient dynamic algorithms for some geometric intersection problems
Towards a real time algorithm for parameterized longest common prefix computation
A comparison of iterative and defined classes of search trees
Some Results for Elementary Operations
Height balance distribution of search trees
Maintaining α-balanced trees by partial rebuilding
Randomized search trees
Title not available (Why is that?)
A comparative study of 2-3 trees and AVL trees
On rotations in fringe-balanced binary trees
Maintaining multiple representations of dynamic data structures
Deletion without rebalancing in multiway search trees
Red-black trees with constant update time
A simple, faster method for kinetic proximity problems
New trie data structures which support very fast search operations
Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
A data structure for dynamic trees
Efficient splitting and merging algorithms for order decomposable problems.
The complexity of on-line simulations between multidimensional turing machines and random access machines
A data structure for dynamic range queries
Optimal binary search trees
Binary search trees in secondary memory
Maintaining range trees in secondary memory. Part I: Partitions
On the average number of rebalancing operations in weight-balanced trees
Binary search trees of almost optimal height
Making data structures persistent
Maintaining order in a generalized linked list
Aspects of insertion in random trees
Agglomerative clustering of growing squares
Expected time analysis for Delaunay point location
Deciding bisimilarity and similarity for probabilistic processes.
Fast algorithms for bin packing
Balanced search trees made simple
Efficient Top-k Queries for Orthogonal Ranges
A worst-case efficient algorithm for hidden-line elimination^†
Worst-case analysis of the set-union problem with extended backtracking
The node visit cost of brother trees
Dynamic deferred data structuring
Implementing dictionaries using binary trees of very small height
Effective splaying with restricted rotations
Purely top-down updating algorithms for stratified search trees
Optimizing binary heaps
Intersection joins under updates
Preprocessing Ambiguous Imprecise Points
Dynamic planar range skyline queries in log logarithmic expected time
Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
A NEW WEIGHT BALANCED BINARY SEARCH TREE
Title not available (Why is that?)
Amortized Computational Complexity

This page was built for publication: Binary Search Trees of Bounded Balance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5678421)