1. G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263–266, 1962. English translation in Soviet Math. Doklay 3, 1962, 1259–1263.
2. M.R. Brown. A partial analysis of random height-balanced trees. SIAM J on Computing, 8(1):33–41, Feb 1979.
3. R.A. Baeza-Yates and G.H. Gonnet. Solving matrix recurrences with applications. Technical Report CS-89-16, Department of Computer Science, University of Waterloo, May 1989.
4. B. Eisenbarth, N. Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, and Derick Wood. The theory of fringe analysis and its application to 2–3 trees and B-trees. Information and Control, 55(1):125–174, Oct 1982.
5. D.E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, Reading, Mass., 1969.