Worst-case and amortised optimality in union-find (extended abstract)

DOI10.1145/301250.301383zbMath1346.68247OpenAlexW2037118252MaRDI QIDQ2819582

Stephen Alstrup, Theis Rauhe, Amir M. Ben-Amram

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301383

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the succinct representation of equivalence classes

This page was built for publication: Worst-case and amortised optimality in union-find (extended abstract)