Author:
Fagerberg Rolf,Jensen Rune E.,Larsen Kim S.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. G. M. Adel’son-Vel’skii and 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. Joan Boyar, Rolf Fagerberg, and Kim S. Larsen. Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. Journal of Computer and System Sciences, 55(3):504–521, 1997.
3. Joan F. Boyar and Kim S. Larsen. Efficient Rebalancing of Chromatic Search Trees. Journal of Computer and System Sciences, 49(3):667–682, 1994.
4. Leo J. Guibas and Robert Sedgewick. A Dichromatic Framework for Balanced Trees. In Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science, pages 8–21, 1978.
5. Kim S. Larsen. Amortized Constant Relaxed Rebalancing using Standard Rotations. Acta Informatica, 35(10):859–874, 1998.