Optimal insertion in two-dimensional arrays

Belal, 1993, Least-cost insertion in one and two-dimensional array Belal, 1993, On the existence of one-bit games in partially played tournaments Abel, 1985, Some elemental operations on linear quad trees for geographic information systems, The Computer J., 28, 73, 10.1093/comjnl/28.1.73 Hoshi, 1985, A counter example to a monotonicity property of k-d trees, Information Processing Lett., 15, 169, 10.1016/0020-0190(82)90099-0 Korsh, 1988 Horbibe, 1979, On the max-entropy rule for a binary search tree, Acta Information, 12, 63, 10.1007/BF00264017 Korsh, 1981, Greedy binary search trees are nearly optimal, Information Processing Lett., 13, 16, 10.1016/0020-0190(81)90143-5 Korsh, 1982, Growing nearly optimal binary search trees, Information Processing Lett., 13, 139, 10.1016/0020-0190(82)90071-0 Mehlborn, 1975, Nearly optimal binary search trees, Acta Informatica, 5, 287 Robson, 1979, The height of binary search trees, Austrian Comput. J., 11 Hu, 1971, Optimal computer search trees and variable-length alphabetic codes, SIAM J. Appl. Math., 21, 514, 10.1137/0121057 Knuth, 1973 McCreight, 1985, Priority search trees, SIAM J. Comput., 10.1137/0214021 Mehlborn, 1977, A best possible bound for the weighted path length of binary search trees, SIAM J. Comput., 6, 235, 10.1137/0206017