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