Author:
Kasyanov Victor N.,Evstigneev Viadimir. A.
Reference27 articles.
1. Bayer, R. and McCreight, C. [BaM] Organization and maintenance of large ordered indexes, Acta Inform, 1, No. 3, 173–189 (1972).
2. Brown, M. R. [Bro] Some observations on random 2-3 trees, Inform. Process. Let., 9, 57–59 (1979).
3. Casarini, F. and Soda, G. [CaS] Binary trees paging, Inform. Syst., 7, No. 4, 337–344 (1982).
4. Cesarini, F. and Soda, G. [CeS] An algorithm to construct a compact B-tree in case of ordered keys, Inform. Let., 17, No. 3, 13–16 (1983).
5. Culic, K., Ottman, Th., and Wood, D. [COW] Dense Multiway Trees, Comp. Sei. Tech. Rep. 79-CS-5, McMaster Univ., Ontario (1979).