1. B. Allen, On binary search trees, Research Report CS-77-27, Department of Compute Science, University of Waterloo.
2. Improved bounds on the costs of optimal and balanced binary search trees;Bayer,1975
3. Time bounds for selection;Blum;J. Comput. System Sci.,1973
4. Time and space bounds for selection problems;Dobkin,1978
5. A simple algorithm for merging two disjoint linearly ordered sets;Hwang;SICOMP,1972