A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.

Norbert Blum Henning Rochow A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. 57-60 1994 51 Inf. Process. Lett. 2 db/journals/ipl/ipl51.html#BlumR94