Top-Down Analysis of Path Compression

DOI10.1137/S0097539703439088zbMath1075.68105MaRDI QIDQ5317162

Raimund Seidel, Micha Sharir

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

inverse Ackermann functionpath compressionunion-find problemdisjoint sets data structure

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (3)

Semi-dynamic Connectivity in the Plane ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ The Inverse of Ackermann Function is Computable in Linear Time

This page was built for publication: Top-Down Analysis of Path Compression