Athreya, K. & Ney, P. (1972). Branching processes. New York: Springer-Verlag.
Bagchi, A. & Pal, A.K. (1985). Asymptotic normality in the generalized Polya-Eggenberger-Urn model, with an application to computer data structures. SIAM Journal of Algebraic and Discrete Methods 6:394–405.
Cunto, W. & Gascón, J.L. (1987). Improving time and space efficiency in generalized binary search trees. Acta Informatica 24: 583–594.
Darroch, J. & Seneta, E. (1965). On quasi-stationary distributions in absorbing discrete-time finite Markov chains. Journal of Applied Probability 2: 88–100.
Devroye, L. (1987). Branching processes in the analysis of the heights of trees. Acta Informatica 24: 277–298.
Eisenbarth, B., Ziviani, N., Gonnet, O., Mehlhorn, K., & Wood, D. (1982). The theory of fringe analysis and its application to 2–3 trees and B-trees. Information and Control 55: 125–174.
Flannery, B. (1986). On quasi-stationary distributions of Markov chains. Ph.D. dissertation, Department of Statistics, University of California, Berkeley.
Knuth, D. (1973). The art of computer programming, Vol. 3. Reading: Addison-Wesley.
Poblete, P. & Munro, J. (1985). The analysis of a fringe heuristic for binary search trees. Journal of Algorithms 6: 336–350.
Yao, A. (1978). On random 2–3 trees. Acta Informatica 9: 159–170.