A Lower Bound on the Complexity of the Union-Split-Find Problem

Kurt Mehlhorn, Stefan Näher, Helmut Alt. A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing, 17(6):1093-1102, 1988.

Abstract

Abstract is missing.