Journal of the ACM Bibliography

Selected papers that cite this one

• Giuseppe Amato, Giuseppe Cattaneo, and Giuseppe F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms (extended abstract). In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 314-323, New Orleans, Louisiana, 5-7 January 1997.

• R. J. Anderson. Primitives for asynchronous list compression. Mathematical Systems Theory, 27(5):453-470, September/October 1994.

• Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, and Maurizio Talamo. The set union problem with unlimited backtracking. SIAM Journal on Computing, 23(1):50-70, February 1994.

• G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15(4):302-318, April 1996.

• Giuseppe Di Battista and Roberto Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, October 1996.

• Richard S. Bird. Functional algorithm design. Science of Computer Programming, 26(1-3):15-31, May 1996.

• Adam L. Buchsbaum, Rajamani Sundar, and Robert E. Tarjan. Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues. SIAM Journal on Computing, 24(6):1190-1206, December 1995.

• Adam L. Buchsbaum and Robert E. Tarjan. Confluently persistent deques via data-structural bootstrapping. Journal of Algorithms, 18(3):513-547, May 1995.

• Zbigniew J. Czech, George Havas, and Bohdan S. Majewski. Perfect hashing. Theoretical Computer Science, 182(1-2):1-143, 15 August 1997. Fundamental Study.

• Michael B. Dillencourt, Hannan Samet, and Markku Tamminen. A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM, 39(2):253-280, April 1992.

• Ye. Dinitz and J. Westbrook. Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica, 20(3):242-276, March 1998.

• Christophe Fiorio and Jens Gustedt. Two linear time Union-Find strategies for image processing. Theoretical Computer Science, 154(2):165-181, 5 February 1996.

• 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.

• Richard J. Lipton, Paul J. Martino, and Andy Neitzke. On the complexity of a set-union problem. In 38th Annual Symposium on Foundations of Computer Science, pages 110-115, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Han La Poutré Lower bounds for the Union-Find and the Split-Find problem on pointer machines. Journal of Computer and System Sciences, 52(1):87-99, February 1996.

• Berry Schoenmakers. A tight lower bound for top-down skew heaps. Information Processing Letters, 61(5):279-284, 14 March 1997.

Shortcuts: