Symmetric binary B-trees: Data structure and maintenance algorithms
From MaRDI portal
Publication:2551313
Cites work
Cited in
(65)- Approximate colored range and point enclosure queries
- On the relationship between son-trees and symmetric binary B-trees
- Optimum multiway search trees
- A new data structure for representing sorted lists
- Stratified balanced search trees
- Self-adjusting multi-way search trees
- A note on the path length of red-black trees
- Implementing dictionaries using binary trees of very small height
- Height balanced 2-3 trees
- Dynamic weighted binary search trees
- Insertion reachability, skinny skeletons, and path length in red-black trees
- Amortization results for chromatic search trees, with an application to priority queues
- Relaxed multi-way trees with group updates.
- Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
- A dynamic fixed windowing problem
- Updating a balanced search tree in 0(1) rotations
- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- An assertional proof of red-black trees using Dafny
- Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
- Fully persistent B-trees
- Red-black trees with relative node keys
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- A direct algorithm for restricted rotation distance
- A note on the largest number of red nodes in red-black trees
- Red-black trees with constant update time
- Layered working-set trees
- Combinatorial optimisation and hierarchical classifications
- Vehicle scheduling under the warehouse-on-wheels policy
- Self-adjusting trees in preactice for large text collections
- Automatic functional correctness proofs for functional search trees
- Deletion without rebalancing in multiway search trees
- Experiments with an adaptive multicut-HDMR map generation for slowly varying continuous multivariate functions
- Dynamic Planar Range Maxima Queries
- More on balanced diets
- Rank-Balanced Trees
- Fast pattern-based algorithms for cutting stock
- Effective splaying with restricted rotations
- Efficient data structures for sparse network representation
- Purely Functional 1-2 Brother Trees
- Amortized Computational Complexity
- Generalized k-d-trees and local reorganizations
- Solving the at-most-once problem with nearly optimal effectiveness
- scientific article; zbMATH DE number 3770965 (Why is no real title available?)
- Dynamic hashing
- Enterprise information system structure optimization based on time property with improved immune genetic algorithm and binary tree
- Pairing heaps: the forward variant
- Dynamic Trees with Almost-Optimal Access Cost
- Fast updating of well-balanced trees
- How to update a balanced binary tree with a constant number of rotations
- Amortization results for chromatic search trees, with an application to priority queues
- Balanced search trees made simple
- Smooth heaps and a dual view of self-adjusting data structures
- Variants of (a,b)-trees with relaxed balance
- An efficient algorithm for estimating rotation distance between two binary trees
- Large-scale linear rankSVM
- Fully persistent B-trees
- Parallel algorithms for red--black trees
- scientific article; zbMATH DE number 7758335 (Why is no real title available?)
- Efficient Simulation of Sparse Graphs of Point Processes
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
- Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
- Parallel data distribution management on shared-memory multiprocessors
- Binary search trees of almost optimal height
- Boundary labeling with octilinear leaders
This page was built for publication: Symmetric binary B-trees: Data structure and maintenance algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551313)
