On rotations in fringe-balanced binary trees
From MaRDI portal
Publication:293176
DOI10.1016/S0020-0190(97)00184-1zbMATH Open1339.68057OpenAlexW1997146555MaRDI QIDQ293176FDOQ293176
Authors: Hosam M. Mahmoud 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001841?np=y
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
- Functionals of critical multitype branching processes
- Title not available (Why is that?)
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- On the structure of random plane‐oriented recursive trees and their branches
- Probabilistic analysis of bucket recursive trees
- Improving time and space efficiency in generalized binary search trees
- Some average measures in m-ary search trees
- On the distribution of leaves in rooted subtrees of recursive trees
- On random 2-3 trees
- A martingale approach to strong convergence in a generalized Pólya- Eggenberger urn model
- Central limit theorems for urn models
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
- Limit laws for local counters in random binary search trees
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- The analysis of a fringe heuristic for binary search trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Locally balanced binary trees
- The theory of fringe analysis and its application to 23 trees and b-trees
- Binary Search Trees of Bounded Balance
- Martingale functional central limit theorems for a generalized Pólya urn
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
- Balanced multicolour Pólya urns via smoothing systems analysis
- Effective splaying with restricted rotations
- 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)
