Publisher
Springer International Publishing
Reference10 articles.
1. Baer, J.-L., Schwab, B.: A comparison of tree-balancing algorithms. Commun. ACM 20(5), 322–330 (1977)
2. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET70, pp. 107–141, New York, NY, USA. ACM (1970)
3. Brodal, G.: Partially persistent data structures of bounded degree with constant update time. BRICS Report Series 1(35) (1994)
4. Cannady, J.M.: Balancing methods for binary search trees. In: Proceedings of the 16th Annual Southeast Regional Conference, ACM-SE’16, pp. 181–186, New York, NY, USA. ACM (1978)
5. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)