A combinatorial approach to the analysis of bucket recursive trees
type: Item
instance of: scholarly article
title: A combinatorial approach to the analysis of bucket recursive trees
zbMATH Open document ID: 1209.05048
author: Markus Kuba
author: Alois Panholzer
published in: Theoretical Computer Science
publication date: 2010-08-11T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5768919
zbMATH Keywords: bucket recursive trees
zbMATH Keywords: node-depth
zbMATH Keywords: number of descendants
zbMATH Keywords: node-degree
zbMATH Keywords: limiting distribution
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.030
OpenAlex ID: W2028945085
cites work: Automata, Languages and Programming
cites work: Degree Distribution of Competition-Induced Preferential Attachment Graphs
cites work: Phase changes in random \(m\)-ary search trees and generalized quicksort
cites work: Singularity Analysis of Generating Functions
cites work: Q3549563
cites work: Random recursive trees and the Bolthausen-Sznitman coalescent
cites work: Q4320535
cites work: On convergence rates in the central limit theorems for combinatorial structures
cites work: Functional limit theorems for multitype branching processes and generalized Pólya urns.
cites work: Probabilistic analysis of bucket recursive trees
cites work: Q4940321
cites work: Distribution of the Steiner Distance in Generalized M-ary Search Trees
cites work: Q4236280
cites work: Q4385514
DOI: 10.1016/J.TCS.2010.05.030
description: scientific article; zbMATH DE number 5768919