1. Balińska, K. T., Quintas, L. V., and Szymansky, J. Random recursive forests. Preprint, August 1991.
2. Bender, E. A. Central and local limit theorems applied to asymptotic enumeration. Journal of Combinatorial Theory 15 (1973), 91–111.
3. Bergeron, F., Labelle, G., and Leroux, P. Computation of the expected number of leaves in a tree having a given automorphism, and related topics. preliminary version, 1991.
4. Burge, W. H. An analysis of a tree sorting method and some properties of a set of trees. In First USA-JAPAN Computer Conference Proceedings (October 1972), AFIPS and IPSJ, pp. 372–378.
5. Chen, W., and Ni, W. Heap ordered trees. Personal communication, October 1991. Based on Wen-Chun Ni's Master Thesis, National Taiwan University.