On random 2-3 trees

DOI10.1007/BF00289075zbMATH Open0369.05024OpenAlexW1983711073MaRDI QIDQ1243733FDOQ1243733

Andrew Chi-Chih Yao

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1007/bf00289075

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Organization and maintenance of large ordered indexes

Cited In (39)

• \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
• Balance in AVL trees and space cost of brother trees
• Modeling B-tree insertion activity
• Expected behaviour of \(B^+\)-trees under random insertions
• Unsafe operations in B-trees
• HCB-tree: a height compressed B-tree for parallel processing
• A comparative study of 2-3 trees and AVL trees
• Search trees and Stirling numbers
• Algorithms for sequential generation of combinatorial structures
• On rotations in fringe-balanced binary trees
• Toward a formal derivation of the expected behavior of prefix B-trees
• 2–3 brother trees
• Higher order analysis of random 1–2 brother trees
• Expected behaviour analysis of AVL trees
• On the average number of rebalancing operations in weight-balanced trees
• Modeling splits in file structures
• Analysis of bounded disorder
• Some average measures in m-ary search trees
• Aspects of insertion in random trees
• On random son-trees
• Bounded disorder: The effect of the index
• Analytic urns
• Performance analysis of file organizations that use multi-bucket data leaves
• Una struttura bidimensionale per la memorizzazione dei file trasposti
• Page usage in a quadtree index
• Average number of rotations access cost in iR-trees
• Some average performance measures for the B-tree
• Unbalanced multiway trees improved by partial expansions
• Binary search trees with limited rotation
• Transforming unbalanced multiway trees into a practical external data structure
• (g//0,g//1,\dots ,g//k)-trees and unary OL systems
• Insertion-safeness in balanced trees
• Improved bounds for the expected behaviour of AVL trees
• Almost optimal dynamic 2-3 trees
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Variance of storage requirements for B+-trees

This page was built for publication: On random 2-3 trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243733)