Kurt Mehlhorn, Stefan Näher, Helmut Alt. A Lower Bound for the Complexity of the Union-Split-Find Problem. In Thomas Ottmann, editor, Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. Volume 267 of Lecture Notes in Computer Science, pages 479-488, Springer, 1987.
@inproceedings{MehlhornNA87,
title = {A Lower Bound for the Complexity of the Union-Split-Find Problem},
author = {Kurt Mehlhorn and Stefan Näher and Helmut Alt},
year = {1987},
researchr = {https://researchr.org/publication/MehlhornNA87},
cites = {0},
citedby = {0},
pages = {479-488},
booktitle = {Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
editor = {Thomas Ottmann},
volume = {267},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-18088-5},
}