Don't rush into a union

DOI10.1145/1993636.1993711zbMath1288.68134OpenAlexW2036896087MaRDI QIDQ5419126

Mikkel Thorup, Mihai Pǎtraşcu

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundscell-probe modeldynamic connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

New amortized cell-probe lower bounds for dynamic problems ⋮ Unnamed Item

This page was built for publication: Don't rush into a union