Journal of the ACM Bibliography

Selected papers that cite this one

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

• Omer Berkman and Uzi Vishkin. On parallel integer merging. Information and Computation, 106(2):266-285, October 1993.

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

• Maria Luisa Bonet and Samuel R. Buss. The serial transitive closure problem for trees. SIAM Journal on Computing, 24(1):109-122, February 1995.

• Bernard Chazelle. A faster deterministic algorithm for minimum spanning trees. In 38th Annual Symposium on Foundations of Computer Science, pages 22-31, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Alain Deutsch. On the complexity of escape analysis. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 358-371, Paris, France, 15-17 January 1997.

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

• Dominic Duggan and Frederick Bent. Explaining type inference. Science of Computer Programming, 27(1):37-83, July 1996.

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

• P. Flajolet, J. Fran\v{c}on, and J. Vuillemin. Sequence of operations analysis for dynamic data structures. Journal of Algorithms, 1(2):111-141, June 1980.

• Greg N. Frederickson. Using cellular graph embeddings in solving all pairs shortest paths problems. Journal of Algorithms, 19(1):45-85, July 1995.

• Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, April 1995.

• Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. In 38th Annual Symposium on Foundations of Computer Science, pages 2-11, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Jens Gustedt. Efficient Union-Find for planar graphs and other sparse graph classes. Theoretical Computer Science, 203(1):123-141, 6 August 1998.

• Michel Habib, Christophe Paul, and Laurent Viennot. A synthesis on partition refinement: A useful routine for strings, graphs, Boolean matrices and automata. In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 25-38, Paris France, 25-27 February 1998. Springer.

• Richard M. Karp and Robert Endre Tarjan. Linear expected-time algorithms for connectivity problems. Journal of Algorithms, 1(4):374-393, December 1980.

• Takeshi Koshiba, Erkki Mäkinen, and Yuji Takada. Learning deterministic even linear languages from positive examples. Theoretical Computer Science, 185(1):63-79, 10 October 1997.

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

• Jens Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. Journal of Algorithms, 20(1):20-44, January 1996.

• Witold Lipski, Jr. and Christos H. Papadimitriou. A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems. Journal of Algorithms, 2(3):211-226, September 1981.

• Martin Loebl and Jaroslav Ne\u{s}et\u{r}il. Linearity and unprovability of set union problem strategies. I. Linearity of strong postorder. Journal of Algorithms, 23(2):207-220, May 1997.

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

• Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, April 1993.

• Ronald L. Rivest and Robert E. Schapire. Diversity-based inference of finite automata. Journal of the ACM, 41(3):555-589, May 1994.

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

• Mikkel Thorup. Parallel shortcutting of rooted trees. Journal of Algorithms, 23(1):139-159, April 1997.

• Mikkel Thorup. Undirected single source shortest paths in linear time. In 38th Annual Symposium on Foundations of Computer Science, pages 12-21, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Mikkel Thorup. Decremental dynamic connectivity. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 305-313, New Orleans, Louisiana, 5-7 January 1997.

Shortcuts: