The shape of unlabeled rooted random trees

This publication has 30 references indexed in Scilit:

• Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
  Algorithmica, 2006
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
  Advances in Applied Probability, 2005
• On Robson's convergence and boundedness conjectures concerning the height of binary search trees
  Theoretical Computer Science, 2004
• The Profile of Binary Search Trees
  The Annals of Applied Probability, 2001
• The Brownian excursion multi-dimensional local time density
  Journal of Applied Probability, 1999
• The SDE Solved By Local Times of a Brownian Excursion or Bridge Derived From the Height Profile of a Random Tree or Forest
  The Annals of Probability, 1999
• On the profile of random trees
  Random Structures & Algorithms, 1997
• On the explicit form of the density of Brownian excursion local time
  Proceedings of the American Mathematical Society, 1982
• On the Altitude of Nodes in Random Trees
  Canadian Journal of Mathematics, 1978
• Twenty-step algorithm for determining the asymptotic number of trees of various speces
  Journal of the Australian Mathematical Society, 1975