1. G. M. Adel’son-Vel’skii and E. M. Landis. An Algorithm for the Organisation of Information. Dokl. Akad. Nauk SSSR, 146:263–266, 1962. In Russian. English translation in Soviet Math. Dokl., 3:1259-1263, 1962. 72
2. Lect Notes Comput Sci;A. Andersson,1989
3. A. Andersson. Effcient Search Trees. PhD thesis, Department of Computer Science, Lund University, Sweden, 1990. 73, 73, 82
4. A. Andersson, C. Icking, R. Klein, and T. Ottmann. Binary search trees of almost optimal height. Acta Informatica, 28:165–178, 1990. 73
5. Lect Notes Comput Sci;A. Andersson,1990