Mehlhorn, K., Näher, S., & Alt, H. (1988). A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing, 17, 1093-1102.