Journal of the ACM Bibliography
Robert Endre Tarjan.
Applications of path compression on balanced trees. Journal of the
ACM, 26(4):690-715, October 1979.
[BibTeX entry]
Selected papers that cite this one
- Bruno Blanchet. Escape
analysis: Correctness proof, implementation and experimental
results. In Conference Record of POPL '98: The 25th ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
pages 25-37, San Diego, California, 19-21 January 1998.
- Hans L. Bodlaender, Gerard Tel, and Nicola Santoro. Trade-offs
in non-reversing diameter. Nordic Journal of Computing,
1(1):111-134, Spring 1994.
- 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.
- B. Dixon and R. E. Tarjan. Optimal
parallel verification of minimum spanning trees in logarithmic time.
Algorithmica, 17(1):11-18, January 1997.
- Greg N. Frederickson. Ambivalent
data structures for dynamic 2-edge-connectivity and k
smallest spaning trees. SIAM Journal on Computing,
26(2):484-538, April 1997.
- Harold N. Gabow and Robert E. Tarjan. Faster scaling algorithms for
general graph-matching problems. Journal of the ACM,
38(4):815-853, October 1991.
- Haim Kaplan, Ron Shamir, and Robert E. Tarjan. Faster and simpler
algorithm for sorting signed permutations by reversals. In
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete
Algorithms, pages 344-351, New Orleans, Louisiana, 5-7 January
1997.
- David R. Karger, Philip N. Klein, and Robert E. Tarjan. A randomized linear-time algorithm
to find minimum spanning trees. Journal of the ACM,
42(2):321-328, March 1995.
- Valerie King, Chung Keung Poon, Vijaya Ramachandran, and Santanu Sinha.
An optimal EREW
PRAM algorithm for minimum spanning tree verification.
Information Processing Letters, 62(3):153-159, 14 May 1997.
- Philip N. Klein and Robert E. Tarjan. A randomized linear-time
algorithm for finding minimum spanning trees. In Proceedings
of the Twenty-Sixth Annual ACM Symposium on the Theory of
Computing, pages 9-15, Montréal, Québec, Canada,
23-25 May 1994.
- Vincenzo Liberatore. Matroid decomposition
methods for the set maxima problem. In Proceedings of the
Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages
400-409, San Francisco, California, 25-27 January 1998.
- 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.
Shortcuts: