G. M. and E. M. Landis, An algorithm for the organization of the information, Soviet Mathematics Doklady, vol.3, pp.1259-1263, 1962.

L. Boug-e, J. Gabarrr, and X. Messeguer, Concurrent A VL revisited: self-balancing distributed search trees, 1995.

L. Boug-e, J. Gabarrr-o, X. Messeguer, and N. Schabanel, Concurrent rebalancing of AVL trees: a ne-grained approach, European Conf. Parallel Proc (Euro-Par '97), pp.421-429, 1997.

R. Bayer and M. Schkolnick, Concurrency of operations on B-trees. Acta Informatica, vol.9, pp.1-21, 1977.

E. W. Dijkstra, L. Lamport, A. J. Martin, C. S. Scholten, and E. F. Steeens, On the y garbage collection: an exercice in cooperation, DLM + 78, vol.21, pp.966-975, 1978.

C. S. Ellis, Concurrent search and insertion in AVL trees, IEEE Trans. Comp., C, vol.29, issue.9, pp.811-817, 1980.

N. Francez, Distributed termination, ACM Trans. Progr. Languages and Systems, vol.2, pp.42-55, 1980.

J. Gabarrr-o and X. Messeguer, Massively parallel and distributed dictionaries on AVL and Brother Trees, Parallel and Distributed Computing Systems, pages 14{17. ISCA, 1996. Look also: Parallel dictionaries with local rules on AVL and Brother trees, 1997.

J. Gabarrr-o and X. Messeguer, A uniied approach to concurrent and parallel algorithms on balanced data structures, Proc. of XVII Int. Conf. Chilean Computer Society, 1997.

J. Gabarrr-o, X. Messeguer, and D. Riu, Concurrent rebalancing on HyperRed-Black trees, Proc. of XVII Int. Conf. Chilean Computer Society, 1997.

L. J. Guibas and R. Sedwick, A dichromatic framework for balanced trees, Proc

A. Symp, Foundations of Computer Science, pp.8-21, 1978.

J. L. Kessels, On the y optimisation of data structures, Comm. ACM, vol.26, issue.11, pp.895-901, 1983.

H. T. Kung and P. L. Lehman, Concurrent manipulation of binary serch trees, ACM Trans. Database Systems, vol.5, issue.3, pp.354-382, 1980.

T. Kasai and R. Miller, Homomorphisms between models of parallel computation, J. Comp. Sys. Sci, vol.25, pp.285-331, 1982.

D. E. Knuth, The art of computer programming, Fundamental algorithms, 1973.

K. S. Larsen, AVL trees with relaxed balance, Proc. Int. Parallel Processing Symp, pp.888-893, 1994.

O. Nurmi and E. Soisalon-soininen, Chromatic binary search trees, Acta informatica, vol.33, issue.6, pp.547-557, 1996.

O. Nurmi and E. Soisalon-soininen, Chromatic binary search trees, a structure for concurrent rebalancing, Acta Informatica, vol.33, issue.6, pp.547-557, 1996.

O. Nurmi, E. Soisalon-soininen, and D. Wood, Concurrency control in database structures with relaxed balance, pp.170-176, 1987.

O. Nurmi, E. Soisalon-soininen, and D. Wood, Concurrent balancing and updationg of AVL trees, 1992.

T. Ottmann, H. Six, and D. Wood, On the correspondence between AVL trees and brother trees, Computing, vol.23, issue.1, pp.43-54, 1979.

T. Ottmann and D. Wood, 1-2 brother trees or AVL trees revisited, The Computer Journal, vol.23, issue.3, pp.248-255, 1979.

R. Sedgewick, . Ph, and . Flajolet, Analysis of algorithms, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00074300

E. Soisalon-soininen and P. Widmayer, Relaxed balancing in search trees, Advances in Algorithmics, languages and Complexity: Essays in Honor of Ronad V. Book, pages 267{283. Kluwer Academic, 1997.