Amortized constant relaxed rebalancing using standard rotations

Acta Informatica

Volumn 35, Issue 10, 1998, Pages 859-874

  Larsen, Kim S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032353037     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050145     Document Type: Article

References (24)

1. G.M. Adel 'son-Vel'skiǐ, E.M. Landis: An Algorithm for the Organisation of Information. Doklady Akadamii Nauk SSSR, 146:263-266 (1962) In Russian. English translation in Soviet Math. Doklady, 3:1259-1263 (1962)
2. G.M. Adel 'son-Vel'skiǐ, E.M. Landis: An Algorithm for the Organisation of Information. Doklady Akadamii Nauk SSSR, 146:263-266 (1962) In Russian. English translation in Soviet Math. Doklady, 3:1259-1263 (1962)
3. A.V. Aho, J.E. Hopcroft, J.D. Ullman: Data Structures and Algorithms. Reading, MA: Addison-Wesley 1983
4. R. Bayer, E. McCreight: Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1:173-189 (1972)
5. J. Boyar, R. Fagerberg, K.S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. In: Fourth International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, Vol 955, pp 270-281. Berlin Heidelberg New York: Springer 1995
6. J. Boyar, R. Fagerberg, K.S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. J Comput Syst Sci 55(3):504-521 (1997)
7. J.F. Boyar, K.S. Larsen: Efficient Rebalancing of Chromatic Search Trees. In: Proceedings of the Third Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol 621, pp 151-164. Berlin Heidelberg New York: Springer 1992
8. J.F. Boyar, K.S. Larsen: Efficient Rebalancing of Chromatic Search Trees. J Comput Syst Sci 49(3):667-682 (1994)
9. L.J. Guibas, R. Sedgewick: A Dichromatic Framework for Balanced Trees. In: Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science, pp 8-21, IEEE Computer Society Press 1978
10. S. Hanke, T. Ottmann, E. Soisalon-Soininen: Relaxed Balanced Red-Black Trees. In: Proc. 3rd Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science, Vol 1203, pp 193-204. Berlin Heidelberg New York: Springer 1997
11. J.E. Hopcroft: Title unknown. Unpublished work on 2-3 trees, 1970
12. S. Huddleston, K. Mehlhorn: A New Data Structure for Representing Sorted Lists. Acta Informatica 17:157-184 (1982)
13. J.L.W. Kessels: On-the-Fly Optimization of Data Structures. Communications of the ACM 26:895-901 (1983)
14. K.S. Larsen: AVL Trees with Relaxed Balance. In: Proceedings of the 8th International Parallel Processing Symposium, pp 888-893. IEEE Computer Society Press 1994
15. K.S. Larsen, R. Fagerberg: B-Trees with Relaxed Balance. In: Proceedings of the 9th International Parallel Processing Symposium, pp 196-202. IEEE Computer Society Press 1995
16. K.S. Larsen, R. Fagerberg: Efficient Rebalancing of B-Trees with Relaxed Balance. Int J Found Comput Sci 7(2):169-186 (1996)
17. K.S. Larsen, T. Ottmann, E. Soisalon-Soininen: Relaxed Balance for Search Trees with Local Rebalancing. In: Fifth Annual European Symposium on Algorithms. Lecture Notes in Computer Science, Vol 1284, pp 350-363. Berlin Heidelberg New York: Springer 1997
18. K.S. Larsen, E. Soisalon-Soininen, P. Widmayer: Relaxed Balance through Standard Rotations. In: Fifth International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, Vol 1272, pp 450-461. Berlin Heidelberg New York: Springer 1997
19. O. Nurmi, E. Soisalon-Soininen, D. Wood: Concurrency Control in Database Structures with Relaxed Balance. In: Proceedings of the 6th ACM Symposium on Principles of Database Systems, pp 170-176, ACM Press 1987
20. O. Nurmi, E. Soisalon-Soininen: Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. In: Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp 192-198, ACM Press 1991
21. T. Ottmann, E. Soisalon-Soininen: Relaxed Balancing Made Simple. Technical Report 71, Institut für Informatik, Universität Freiburg, 1995
22. N. Sarnak, R.E. Tarjan: Planar Point Location Using Persistent Search Trees. Communications of the ACM 29:669-679 (1986)
23. E. Soisalon-Soininen, P. Widmayer: Relaxed Balancing in Search Trees. In: Advances in Algorithms, Languages, and Complexity, pp 267-283. Hingham, MA: Kluwer Academic Publishers 1997
24. R.E. Tarjan: Amortized Computational Complexity. SIAM Journal on Algebraic and Discrete Methods 6(2):306-318 (1985)