Probabilistic analysis of bucket recursive trees
From MaRDI portal
Publication:672992
DOI10.1016/0304-3975(94)00308-6zbMath0874.68231OpenAlexW2007587312MaRDI QIDQ672992
Robert T. Smythe, Hosam M. Mahmoud
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00308-6
Related Items
On bucket increasing trees, clustered increasing trees and increasing diamonds, The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases, Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls, On rotations in fringe-balanced binary trees, Variance in randomized play-the-winner clinical trials, Central limit theorems for urn models, Labels distance in bucket recursive trees with variable capacities of buckets, Profile of random exponential recursive trees, Tree evolution processes for bucket increasing trees, Attribute grammars and automatic complexity analysis, Depth in bucket recursive trees with variable capacities of buckets, Phase changes in randomm-ary search trees and generalized quicksort, Random sprouts as internet models, and Pólya processes, A combinatorial approach to the analysis of bucket recursive trees, Central limit theorems for generalized Pólya urn models, On the Multiplicative Zagreb Indices of Bucket Recursive Trees, Combinatorial Analysis of Growth Models for Series-Parallel Networks, DRAWING MULTISETS OF BALLS FROM TENABLE BALANCED LINEAR URNS, On the internal structure of random recursive circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching processes in the analysis of the heights of trees
- Applications of the theory of records in the study of random trees
- Functionals of critical multitype branching processes
- Limiting Distributions for Path Lengths in Recursive Trees
- The analysis of a fringe heuristic for binary search trees
- The first- and last-birth problems for a multitype age-dependent branching process
- Analysis of the space of search trees under the random insertion algorithm
- Note on the heights of random recursive trees and random m‐ary search trees
- The Joint Distribution of Elastic Buckets in Multiway Search Trees