no. 5
Updating approximately complete trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 5, pp. 431-446. 
@article{ITA_1994__28_5_431_0,
     author = {Lai, Tony W. and Wood, Derick},
     title = {Updating approximately complete trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {431--446},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {5},
     year = {1994},
     mrnumber = {1296646},
     zbl = {0884.68094},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1994__28_5_431_0/}
}
TY  - JOUR
AU  - Lai, Tony W.
AU  - Wood, Derick
TI  - Updating approximately complete trees
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1994
SP  - 431
EP  - 446
VL  - 28
IS  - 5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1994__28_5_431_0/
LA  - en
ID  - ITA_1994__28_5_431_0
ER  - 
%0 Journal Article
%A Lai, Tony W.
%A Wood, Derick
%T Updating approximately complete trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1994
%P 431-446
%V 28
%N 5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1994__28_5_431_0/
%G en
%F ITA_1994__28_5_431_0
Lai, Tony W.; Wood, Derick. Updating approximately complete trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 5, pp. 431-446. http://archive.numdam.org/item/ITA_1994__28_5_431_0/

1. G. M. Adel'Son-Vel'Skii and E. M. Landis, An algorithm for the organization of information, Sov. Math. Dokl., 19623, pp. 1259-1262.

2. A. Andersson, Improving partial rebuilding by using simple balance criteria, In Proceedings of the 1989 Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 1989, 447, Springer-Verlag, pp. 393-402. | Zbl

3. A. Andersson, Efficient Search Trees, PhD thesis, Lund University, Sweden, 1990.

4. A. Andersson and T. W. Lai, Comparison-efficient and write-optimal searching and sorting, In Proceedings of the 2nd Annual International Symposium on Algorithms, Lecture Notes in Computer Science, 1991, 557, Springer-Verlag, pp. 273-282. | MR

5. T. E. Gerasch, An insertion algorithm for a minimal internal path length binary search tree, Communications of the ACM, 1988, 31, pp. 579-585.

6. L. C. Guibas and R. Sedgewick A dichromatic framework for balanced trees, In Proceedings of the 19th Annual IEEE Sympossium on Foundations of Computer Science, 1978, pp. 8-21. | MR

7. T. W. H. Lai, Efficient Maintenance of Binary Search Trees, Ph. D thesis, University of Waterloo, 1990.

8. T. W. H. Lai and D. Wood, Updating approximately complete trees, Technical Report CS-89-57, University of Waterloo, 1989.

9. T. W. H. Lai and D. Wood, Updating almost complete trees or one level makes all the difference, In Proceedings of the 7th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 1990, 415, Springer-Verlag, pp. 188-194. | MR | Zbl

10. J. I. Munro, Private communication.

11. J. Nievergelt and E. M. Reingold, Binary search trees of bounded balance, SIAM Journal on Computing, 1973, 2, pp. 33-43. | MR | Zbl

12. M. H. Overmars, The Design of Dynamic Data Structures, volume 156 of Lecture Notes in Computer Science, 1983, Springer-Verlag. | MR | Zbl

13. M. H. Overmars and J. Van Leeuwen, Dynamic multi-dimensional datta structures based on quad- and k-d trees, Acta Informatica, 1982, 17, pp. 267-285. | MR | Zbl

14. E. M. Reingold and W. J. Hansen, Data Structures in Pascal, Little, Brown and Company, 1986.

15. Q. F. Stout and B. L. Warren, Tree rebalancing in optimal time and space, Communications of the ACM, 1986, 29, pp. 902-908.

16. J. Van Leeuwen and D. Wood, Dynamization of decomposable searching problem, Information Processing Letters, 1980, 10, pp.51-56. | MR