The pairing heap: a new form of self-adjusting heap
Algorithmica
Distances in random plane-oriented recursive trees
Journal of Computational and Applied Mathematics - Special issue on asymptotic methods in analysis and combinatorics
Internal path length of the binary representation of heap-ordered trees
Information Processing Letters
Heap-ordered trees, 2-partitions and continued fractions
European Journal of Combinatorics
Asymptotic expansions for the Stirling numbers of the first kind
Journal of Combinatorial Theory Series A
On the profile of random trees
Random Structures & Algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
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
Journal of Algorithms - Analysis of algorithms
Kinetic heap-ordered trees: tight analysis and improved algorithms
Information Processing Letters
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
On Some Parameters in Heap Ordered Trees
Combinatorics, Probability and Computing
Limiting distributions for additive functionals on Catalan trees
Theoretical Computer Science
The Maximum Degree of the Barabási–Albert Random Tree
Combinatorics, Probability and Computing
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
SIAM Journal on Discrete Mathematics
Asymptotic degree distribution in random recursive trees
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
The climbing depth of random trees
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Concentration of vertex degrees in a scale-free random graph process
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Combinatorics, Probability and Computing
The shape of unlabeled rooted random trees
European Journal of Combinatorics
The degree profile of random Pólya trees
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
We derive several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximation to the expected width, and the correlation coefficients of two level sizes. Most of our proofs are based on a method of moments. We also discover an unexpected connection between the profile of plane-oriented recursive trees (with logarithmic height) and that of random binary trees (with height proportional to the square root of tree size). © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007 An extended abstract of this paper appears in a special issue (DMTCS Proceedings Volume AD, 2005, pp. 193–200) of Discrete Mathematics and Theoretical Computer Science for the 2005 International Conference on the Analysis of Algorithms, Barcelona, June 6–10, 2005.