## Kurt Mehlhorn, Stefan Näher, Helmut Alt

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

ICALP, 1987.

@inproceedings{ICALP-1987-MehlhornNA, author = "Kurt Mehlhorn and Stefan Näher and Helmut Alt", booktitle = "{Proceedings of the 14th International Colloquium on Automata, Languages and Programming}", doi = "10.1007/3-540-18088-5_41", isbn = "3-540-18088-5", pages = "479--488", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{A Lower Bound for the Complexity of the Union-Split-Find Problem}", volume = 267, year = 1987, }