On rotations in fringe-balanced binary trees
From MaRDI portal
Recommendations
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees
- Using Pólya urns to show normal limit laws for fringe subtrees in \(m\)-ary search trees
- On the expected height of fringe-blanced trees
- The left-right-imbalance of binary search trees
- Improved bounds for the expected behaviour of AVL trees
Cites work
- scientific article; zbMATH DE number 3934391 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- A martingale approach to strong convergence in a generalized Pólya- Eggenberger urn model
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- Binary Search Trees of Bounded Balance
- Central limit theorems for urn models
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- Functionals of critical multitype branching processes
- Improving time and space efficiency in generalized binary search trees
- Limit laws for local counters in random binary search trees
- Locally balanced binary trees
- Martingale functional central limit theorems for a generalized Pólya urn
- On random 2-3 trees
- On the distribution of leaves in rooted subtrees of recursive trees
- On the structure of random plane‐oriented recursive trees and their branches
- Probabilistic analysis of bucket recursive trees
- Some average measures in m-ary search trees
- The analysis of a fringe heuristic for binary search trees
- The theory of fringe analysis and its application to 23 trees and b-trees
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
Cited in
(16)- Occupancy urn models in the analysis of algorithms
- Balancing \(m\)-ary search trees with compressions on the fringe
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees
- The class of tenable zero-balanced Pólya urn schemes: characterization and Gaussian phases
- First-passage properties of the Pólya urn process
- Random sprouts as internet models, and Pólya processes
- The characterization of tenable Pólya urns
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Phase changes in random \(m\)-ary search trees and generalized quicksort
- Analytic urns
- An almost sure result for path lengths in binary search trees
- Effective splaying with restricted rotations
- Balanced multicolour Pólya urns via smoothing systems analysis
- Drawing multisets of balls from tenable balanced linear urns
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
This page was built for publication: On rotations in fringe-balanced binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293176)
