A combinatorial approach to the analysis of bucket recursive trees
From MaRDI portal
Publication:986560
DOI10.1016/J.TCS.2010.05.030zbMATH Open1209.05048OpenAlexW2028945085MaRDI QIDQ986560FDOQ986560
Authors: 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
Recommendations
- Probabilistic analysis of bucket recursive trees
- Depth in bucket recursive trees with variable capacities of buckets
- Labels distance in bucket recursive trees with variable capacities of buckets
- On bucket increasing trees, clustered increasing trees and increasing diamonds
- On the Multiplicative Zagreb Indices of Bucket Recursive Trees
Cites Work
- Title not available (Why is that?)
- Analytic combinatorics
- On convergence rates in the central limit theorems for combinatorial structures
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Probabilistic analysis of bucket recursive trees
- Random recursive trees and the Bolthausen-Sznitman coalescent
- Title not available (Why is that?)
- Automata, Languages and Programming
- Title not available (Why is that?)
- Phase changes in random \(m\)-ary search trees and generalized quicksort
- Distribution of the Steiner Distance in Generalized M-ary Search Trees
- Degree Distribution of Competition-Induced Preferential Attachment Graphs
Cited In (10)
- Title not available (Why is that?)
- Combinatorial analysis of growth models for series-parallel networks
- Geometric bucket trees: analysis of linear bucket tree
- Depth in bucket recursive trees with variable capacities of buckets
- Tree evolution processes for bucket increasing trees
- On bucket increasing trees, clustered increasing trees and increasing diamonds
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Labels distance in bucket recursive trees with variable capacities of buckets
- The subtree size profile of bucket recursive trees
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
This page was built for publication: A combinatorial approach to the analysis of bucket recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986560)