Symmetric binary B-trees: Data structure and maintenance algorithms

DOI10.1007/BF00289509zbMath0233.68009WikidataQ55878145 ScholiaQ55878145MaRDI QIDQ2551313

Publication date: 1972

Published in: Acta Informatica (Search for Journal in Brave)

68R10: Graph theory (including graph drawing) in computer science

68N01: General topics in the theory of software

Related Items

Amortization results for chromatic search trees, with an application to priority queues, Fast updating of well-balanced trees, How to update a balanced binary tree with a constant number of rotations, Balanced search trees made simple, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, Pairing heaps: the forward variant., Dynamic Trees with Almost-Optimal Access Cost, VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE, An efficient algorithm for estimating rotation distance between two binary trees, Large-Scale Linear RankSVM, Unnamed Item, Parallel algorithms for red--black trees, Unnamed Item, Efficient Simulation of Sparse Graphs of Point Processes, Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines, Vehicle scheduling under the warehouse-on-wheels policy, Experiments with an adaptive multicut-HDMR map generation for slowly varying continuous multivariate functions, Fast pattern-based algorithms for cutting stock, Generalized \(k\)-\(d\)-trees and local reorganizations, Solving the at-most-once problem with nearly optimal effectiveness, Enterprise information system structure optimization based on time property with improved immune genetic algorithm and binary tree, Binary search trees of almost optimal height, Boundary labeling with octilinear leaders, 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, Self‐adjusting trees in practice for large text collections, Automatic Functional Correctness Proofs for Functional Search Trees, Deletion without rebalancing in multiway search trees, Dynamic Planar Range Maxima Queries, More on balanced diets, Rank-Balanced Trees, Effective splaying with restricted rotations, Efficient data structures for sparse network representation, Purely Functional 1-2 Brother Trees, Amortized Computational Complexity, Unnamed Item, Dynamic hashing

Cites Work