Arbitrary weight changes in dynamic trees
RAIRO. Informatique théorique, Tome 15 (1981) no. 3, pp. 183-211.
@article{ITA_1981__15_3_183_0,
     author = {Mehlhorn, Kurt},
     title = {Arbitrary weight changes in dynamic trees},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {183--211},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {3},
     year = {1981},
     mrnumber = {630062},
     zbl = {0467.68022},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1981__15_3_183_0/}
}
TY  - JOUR
AU  - Mehlhorn, Kurt
TI  - Arbitrary weight changes in dynamic trees
JO  - RAIRO. Informatique théorique
PY  - 1981
SP  - 183
EP  - 211
VL  - 15
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1981__15_3_183_0/
LA  - en
ID  - ITA_1981__15_3_183_0
ER  - 
%0 Journal Article
%A Mehlhorn, Kurt
%T Arbitrary weight changes in dynamic trees
%J RAIRO. Informatique théorique
%D 1981
%P 183-211
%V 15
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1981__15_3_183_0/
%G en
%F ITA_1981__15_3_183_0
Mehlhorn, Kurt. Arbitrary weight changes in dynamic trees. RAIRO. Informatique théorique, Tome 15 (1981) no. 3, pp. 183-211. http://www.numdam.org/item/ITA_1981__15_3_183_0/

Aho, Hopcroft and Ullman, The Design andAnalysis of Computer Algorithms, Addison Wesley, 1974. | Zbl

B. Allan and I. Munro, Self-Organizing Binary Search Tress, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 526-535. | MR | Zbl

J. L. Baer, Weight-Balanced Trees, Proc. A.F.I.P.S., Vol. 44, 1975, pp. 467-472.

N. Blum and K. Mehlhorn, On the Average Number of Balancing Operations in Weight-Balanced Trees, Theoretical Computer Science II, 1980, pp. 303-320. | MR | Zbl

K. Mehlhorn, [79], Dynamic Binary Search, S.I.A.M. J. Comput., Vol. 8, No. 2, 1979. pp. 175-198. | MR | Zbl

K. Mehlhorn, Effiziente Algorithmen, Teubner Verlag, Studienücher Informatik, 1977. | MR | Zbl

J. Nievergelt and E. M. Reingold, Binary Search Trees of Bounded Balance, S.I.A.M. J. Comput., Vol. 2, No. 1, March 1973, pp. 33-43. | MR | Zbl

K. Unterauer, Optimierung gewichtetet Binärbäume zur Organisation geordneter dynamischer Dateien, Doktorarbeit, TU München, 1977.

K. Unterauer, Dynamic weighted Binary Search Trees, Acta Informatica, 1979, pp. 341-362. | MR | Zbl