A Lower Bound on the Complexity of the Union-Split-Find Problem
Work
Year: 1988
Type: article
Abstract: We prove a $\Theta (\log \log n)$ (i.e., matching upper and lower) bound on the complexity of the Union-Split-Find problem, a variant of the Union-Find problem. Our lower bound holds for all pointer m... more
Source: SIAM Journal on Computing
Authors Kurt Mehlhorn, Stefan Näher, Helmut Alt
Institutions Saarland University, Freie Universität Berlin
Cites: 11
Cited by: 39
Related to: 10
FWCI: 3
Citation percentile (by year/subfield): 90.5
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green