Enumerative combinatorics
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Probabilistic analysis of bucket recursive trees
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
On convergence rates in the central limit theorems for combinatorial structures
European Journal of Combinatorics
Phase changes in random m-ary search trees and generalized quicksort
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Distribution of the Steiner Distance in Generalized M-ary Search Trees
Combinatorics, Probability and Computing
Degree Distribution of Competition-Induced Preferential Attachment Graphs
Combinatorics, Probability and Computing
Analytic Combinatorics
Hi-index | 5.23 |
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees. Our analysis is based on the description of bucket recursive trees as a special instance of the so-called bucket increasing trees, which is a family of combinatorial objects introduced in this paper. Using this combinatorial description we obtain exact and limiting distribution results for the parameter depth of a specified element, descendants of a specified element and degree of a specified element.