Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations

Michael Fuchs. Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations. Combinatorics, Probability & Computing, 17(5):661-680, 2008. [doi]

Authors

Michael Fuchs

This author has not been identified. Look up 'Michael Fuchs' in Google