The theory of fringe analysis and its application to 23 trees and b-trees
From MaRDI portal
Publication:5186749
DOI10.1016/S0019-9958(82)90534-4zbMath0561.68050MaRDI QIDQ5186749
Bernhard Eisenbarth, Kurt Mehlhorn, Gaston H. Gonnet, Nivio Ziviani, Derick Wood
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Related Items (18)
Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. ⋮ \(B\)-trees with lazy parent split ⋮ On rotations in fringe-balanced binary trees ⋮ Expected behaviour analysis of AVL trees ⋮ Bounded disorder: The effect of the index ⋮ Variance of storage requirements for B+-trees ⋮ Modeling splits in file structures ⋮ Expected behaviour of \(B^+\)-trees under random insertions ⋮ Some average measures in m-ary search trees ⋮ Analysis of bounded disorder ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ Performance analysis of file organizations that use multi-bucket data leaves ⋮ Improved bounds for the expected behaviour of AVL trees ⋮ \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half ⋮ Unbalanced multiway trees improved by partial expansions ⋮ Analytic urns ⋮ Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains ⋮ Optimal bounded disorder.
This page was built for publication: The theory of fringe analysis and its application to 23 trees and b-trees
