Top-down analysis of path compression

SIAM Journal on Computing

Volumn 34, Issue 3, 2005, Pages 515-525

  Seidel, Raimund ^a   Sharir, Micha ^b,c  

^a SAARLAND UNIVERSITY   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Disjoint sets data structure; Inverse Ackermann function; Path compression; Union find problem

Indexed keywords

DISJOINT SETS DATA STRUCTURES; INVERSE ACKERMANN FUNCTION; PATH COMPRESSION; UNION-FIND PROBLEMS;

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; FUNCTIONS; INTEGER PROGRAMMING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

PROBLEM SOLVING;

EID: 20544465452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703439088     Document Type: Article

References (10)

1. T. H. CORMAN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
2. M. J. FISCHER, Efficiency of equivalence algorithms, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 153-168.
3. M. L. FREDMAN AND M. E. SAKS, The cell probe complexity of dynamic data structures, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1989, pp. 345-354.
4. G. C. HARFST AND E. M. REINGOLD, A potential-based amortized analysis of the union-find data structure, ACM SIGACT News, 31 (3) (September 2000), pp. 86-95.
5. J. E. HOPCROFT AND J. D. ULLMAN, Set merging algorithms, SIAM J. Comput., 2 (1973), pp. 294-303.
6. D. C. KOZEN, The Design and Analysis of Algorithms, Texts Monogr. Comput. Sci., Springer, New York, 1992.
7. R. E. TARJAN, Efficiency of a good but not linear set union algorithm, J. ACM, 22 (1975), pp. 215-225.
8. R. E. TARJAN, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110-127.
9. R. E. TARJAN AND J. VAN LEEUWEN, Worst-case analysis of set union algorithms, J. ACM, 31 (1984), pp. 245-281.
10. R. E. TARJAN, Princeton cs423 class notes, 1999; available online from http://www.cs.princeton.edu/courses/archive/spring99/cs423/handouts.html.