Journal of the ACM Bibliography
Marc J. van Kreveld and Mark H. Overmars.
Union-copy structures and dynamic segment trees. Journal of the
ACM, 40(3):635-652, July 1993.
[BibTeX entry]
Selected papers that cite this one
Selected references
- Leo J. Guibas and Robert Sedgewick. A dichromatic framework for
balanced trees. In 19th Annual Symposium on Foundations of
Computer Science, pages 8-21, Ann Arbor, Michigan, 16-18 October
1978. IEEE.
- J. A. La Poutré Lower bounds for the
Union-Find and the Split-Find problem on pointer machines. In
Proceedings of the Twenty Second Annual ACM Symposium on Theory of
Computing, pages 34-44, Baltimore, Maryland, 14-16 May 1990.
- Robert Endre Tarjan. Efficiency of a good but not linear
set union algorithm. Journal of the ACM, 22(2):215-225,
April 1975.
- Robert E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union
algorithms. Journal of the ACM, 31(2):245-281, April
1984.
Shortcuts: