1. Adelson-velskii, G.M., Landis, E.Nl.: Doklady akademia nauk sssr (1962)
2. Chang, S.K.: Parallel balancing of binary search trees. IEEE Trans. Comput. 23, 441–445 (1974)
3. Haq, E., Cheng, Y., Iyengar, S.S.: New algorithms for balancing binary search trees. In: IEEE Conference Proceedings, pp. 378–382 (1988)
4. Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acfa Inf. 1(4), 290–306 (1972)
5. Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the 19th Symposium on the Foundations of Computer Science (1978)