A. Andersson, Improving partial rebuilding by using simple balance criteria, 1st Wokshop on Algorithms and Data Structures, pp.393-402, 1989.
DOI : 10.1007/3-540-51542-9_33

C. R. Aragon and R. G. Seidel, Randomized Search Trees, Proceedings of the 30th Annual IEEE Symposium on the Foundations of Computer Science, pp.540-545, 1989.

N. Blum and K. Mehlhorn, On the average number of rebalancing operations in weight-balanced trees, Theoretical Computer Science, vol.11, issue.3, pp.303-320, 1980.
DOI : 10.1016/0304-3975(80)90018-3

J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, Making data structures persistent, Journal of Computer and System Sciences, vol.38, issue.1, pp.86-124, 1989.
DOI : 10.1016/0022-0000(89)90034-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.6781

I. Galperin and R. L. Rivest, Scapegoat Trees, 4th ACM-SIAM Symposium on Discrete Algorithms, pp.165-174, 1993.

L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pp.8-21, 1978.
DOI : 10.1109/SFCS.1978.3

K. Mehlhorn, Sorting and Searching, volume 1 of Data Structures and Algorithms, 1986.

J. Nievergelt and M. Reingold, Binary Search Trees of Bounded Balance, SIAM Journal on Computing, vol.2, issue.1, pp.33-43, 1973.
DOI : 10.1137/0202005