Advertisement

Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily)

  • Raimund Seidel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4059)

Abstract

Path compression is used in a number of algorithms, most notably in various very natural solutions to the so-called Union-Find problem. This problem is basic and important enough to be covered in most introductory courses and textbooks on algorithms and data structures. However the performance analysis of the solutions is more often than not at best incomplete if not omitted altogether. Already the definition of the function α, the interesting constituent of the time bound, as a quasi inverse of the Ackermann function is complicated and not easy to understand.

Keywords

Data Structure Communication Network Performance Analysis Potential Function Previous Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Seidel, R., Sharir, M.: Top-Down Analysis of Path Compression. SIAM J. Comput. 34, 515–525 (2005)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Raimund Seidel
    • 1
  1. 1.Fachrichtung Informatik, Im StadtwaldUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations