A lower bound on the complexity of the union-split-find problem (1988)

by K Mehlhorn, S Näher, H Alt
Venue:SIAM Journal on Computing