A Lower Bound for the Complexity of the Union-Split-Find Problem.

Kurt Mehlhorn, Stefan Nher, Helmut Alt

Browse the full ICALP paper archive.