Probabilistic analysis of bucket recursive trees

DOI10.1016/0304-3975(94)00308-6MaRDI QIDQ672992zbMATH OpenOpenAlexFDO

Authors Hosam M. Mahmoud, Robert T. Smythe

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

zbMATH Keywords

bucket recursive tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Depth in bucket recursive trees with variable capacities of buckets
• Labels distance in bucket recursive trees with variable capacities of buckets
• A combinatorial approach to the analysis of bucket recursive trees
• The size of random bucket trees via urn models

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 3349139 (Why is no real title available?)
• Analysis of the space of search trees under the random insertion algorithm
• Applications of the theory of records in the study of random trees
• Branching processes in the analysis of the heights of trees
• Functionals of critical multitype branching processes
• Limiting Distributions for Path Lengths in Recursive Trees
• Note on the heights of random recursive trees and random m‐ary search trees
• The Joint Distribution of Elastic Buckets in Multiway Search Trees
• The analysis of a fringe heuristic for binary search trees
• The first- and last-birth problems for a multitype age-dependent branching process

Cited in

(26)

• scientific article; zbMATH DE number 7560520 (Why is no real title available?)
• Combinatorial analysis of growth models for series-parallel networks
• scientific article; zbMATH DE number 1456964 (Why is no real title available?)
• On the internal structure of random recursive circuits
• On the Multiplicative Zagreb Indices of Bucket Recursive Trees
• A combinatorial approach to the analysis of bucket recursive trees
• Geometric bucket trees: analysis of linear bucket tree
• The class of tenable zero-balanced Pólya urn schemes: characterization and Gaussian phases
• On rotations in fringe-balanced binary trees
• Depth in bucket recursive trees with variable capacities of buckets
• Random sprouts as internet models, and Pólya processes
• Tree evolution processes for bucket increasing trees
• On bucket increasing trees, clustered increasing trees and increasing diamonds
• Branches in bucket recursive trees with variable capacities of buckets
• Characterization and enumeration of certain classes of tenable Pólya urns grown by drawing multisets of balls
• Central limit theorems for urn models
• Labels distance in bucket recursive trees with variable capacities of buckets
• Phase changes in random m-ary search trees and generalized quicksort
• The subtree size profile of bucket recursive trees
• Central limit theorems for generalized Pólya urn models
• Probabilistic analysis of vantage point trees
• Attribute grammars and automatic complexity analysis
• Profile of random exponential recursive trees
• The size of random bucket trees via urn models
• Drawing multisets of balls from tenable balanced linear urns
• Variance in randomized play-the-winner clinical trials

This page was built for publication: Probabilistic analysis of bucket recursive trees

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