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]
@article{Fuchs08,
title = {Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations},
author = {Michael Fuchs},
year = {2008},
doi = {10.1017/S0963548308009243},
url = {http://dx.doi.org/10.1017/S0963548308009243},
tags = {search},
researchr = {https://researchr.org/publication/Fuchs08},
cites = {0},
citedby = {0},
journal = {Combinatorics, Probability & Computing},
volume = {17},
number = {5},
pages = {661-680},
}