Symmetric binary B-trees: Data structure and maintenance algorithms
From MaRDI portal
Publication:2551313
DOI10.1007/BF00289509zbMath0233.68009WikidataQ55878145 ScholiaQ55878145MaRDI QIDQ2551313
Publication date: 1972
Published in: Acta Informatica (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of software (68N01)
Related Items
Vehicle scheduling under the warehouse-on-wheels policy, Insertion reachability, skinny skeletons, and path length in red-black trees, A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations, Experiments with an adaptive multicut-HDMR map generation for slowly varying continuous multivariate functions, Fast updating of well-balanced trees, How to update a balanced binary tree with a constant number of rotations, Balanced search trees made simple, Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees, Rank-Balanced Trees, Space saving generalization of \(B\)-trees with \(2/3\) utilization, Fast pattern-based algorithms for cutting stock, A direct algorithm for restricted rotation distance, An efficient algorithm for estimating rotation distance between two binary trees, Amortized Computational Complexity, A note on the largest number of red nodes in red-black trees, Amortization results for chromatic search trees, with an application to priority queues, Deletion without rebalancing in multiway search trees, Generalized \(k\)-\(d\)-trees and local reorganizations, Solving the at-most-once problem with nearly optimal effectiveness, On the relationship between son-trees and symmetric binary B-trees, Optimum multiway search trees, Red-black trees with constant update time, Efficient Simulation of Sparse Graphs of Point Processes, Effective splaying with restricted rotations, Relaxed multi-way trees with group updates., Space-efficient functional offline-partially-persistent trees with applications to planar point location, Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines, Layered working-set trees, Fully persistent B-trees, Binary search trees of almost optimal height, Efficient data structures for sparse network representation, Unnamed Item, A new data structure for representing sorted lists, Enterprise information system structure optimization based on time property with improved immune genetic algorithm and binary tree, Large-Scale Linear RankSVM, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, Stratified balanced search trees, Self-adjusting multi-way search trees, Pairing heaps: the forward variant., Dynamic Trees with Almost-Optimal Access Cost, An assertional proof of red-black trees using Dafny, Dynamic Planar Range Maxima Queries, Self‐adjusting trees in practice for large text collections, Unnamed Item, A note on the path length of red-black trees, More on balanced diets, Red-black trees with relative node keys, Combinatorial optimisation and hierarchical classifications, Boundary labeling with octilinear leaders, Dynamic hashing, Implementing dictionaries using binary trees of very small height, Amortization results for chromatic search trees, with an application to priority queues, Parallel algorithms for red--black trees, Height balanced 2-3 trees, Dynamic weighted binary search trees, Approximate colored range and point enclosure queries, Automatic Functional Correctness Proofs for Functional Search Trees, Purely Functional 1-2 Brother Trees, A dynamic fixed windowing problem, Updating a balanced search tree in 0(1) rotations, VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE, Unnamed Item, Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
Cites Work
