Selected papers that cite this one
- Adam L. Buchsbaum and Robert E. Tarjan. Confluently persistent deques via data-structural bootstrapping. Journal of Algorithms, 18(3):513-547, May 1995.
- Marc J. van Kreveld and Mark H. Overmars. Concatenable structures for decomposable problems. Information and Computation, 110(1):130-148, April 1994.
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.