A combinatorial approach to the analysis of bucket recursive trees

DOI10.1016/j.tcs.2010.05.030zbMath1209.05048OpenAlexW2028945085MaRDI QIDQ986560

Markus Kuba, Alois Panholzer

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.030

zbMATH Keywords

limiting distributionbucket recursive treesnode-degreenode-depthnumber of descendants

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items

On bucket increasing trees, clustered increasing trees and increasing diamonds ⋮ Labels distance in bucket recursive trees with variable capacities of buckets ⋮ Tree evolution processes for bucket increasing trees ⋮ Depth in bucket recursive trees with variable capacities of buckets ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis of bucket recursive trees
• Random recursive trees and the Bolthausen-Sznitman coalescent
• On convergence rates in the central limit theorems for combinatorial structures
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Phase changes in randomm-ary search trees and generalized quicksort
• Singularity Analysis of Generating Functions
• Distribution of the Steiner Distance in Generalized M-ary Search Trees
• Automata, Languages and Programming
• Degree Distribution of Competition-Induced Preferential Attachment Graphs

This page was built for publication: A combinatorial approach to the analysis of bucket recursive trees