Author:
Hanke S.,Ottmann Th.,Soisalon-Soininen E.
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Adel'son-Vels'kii, G.M, Landis, E.M.: ”An algorithm for the organisation of information”; Soviet Math. Dokl., 3 (1962), 1259–1262.
2. Bayer, R., McCreight, E.: ”Organization and maintenance of large ordered indexes”; Acta Informatica, 1 (1972), 173–189.
3. Boyar, J., Fagerberg, R., Larsen, K.: ”Amortization Results for Chromatic Search Trees, with an Application to Priority Queues”; 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 955 (1995), 270–281.
4. Boyar, J., Fagerberg, R., Larsen, K.: ”Chromatic priority queues”; Preprint 15, Department of Mathematics and Computer Science, Odense University (1994).
5. Boyar, J., Larsen, K.: ”Efficient rebalancing of chromatic search trees”; Journal of Computer and System Sciences, 49 (1994), 667–682.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献