%0 Conference Paper %1 conf/icalp/MehlhornNA87 %A Mehlhorn, Kurt %A Näher, Stefan %A Alt, Helmut %B ICALP %D 1987 %E Ottmann, Thomas %I Springer %K %P 479-488 %T A Lower Bound for the Complexity of the Union-Split-Find Problem. %U http://dblp.uni-trier.de/db/conf/icalp/icalp87.html#MehlhornNA87 %V 267 %@ 0-387-18088-5

@inproceedings{conf/icalp/MehlhornNA87, added-at = {2023-12-13T06:45:37.000+0100}, author = {Mehlhorn, Kurt and Näher, Stefan and Alt, Helmut}, biburl = {https://www.bibsonomy.org/bibtex/261354e390533f9ad9bd2be751a4ce08e/admin}, booktitle = {ICALP}, crossref = {conf/icalp/1987}, editor = {Ottmann, Thomas}, ee = {https://doi.org/10.1007/3-540-18088-5_41}, interhash = {b165f9422edecb3cf4dc83feff092156}, intrahash = {61354e390533f9ad9bd2be751a4ce08e}, isbn = {0-387-18088-5}, keywords = {}, pages = {479-488}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T06:45:37.000+0100}, title = {A Lower Bound for the Complexity of the Union-Split-Find Problem.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp87.html#MehlhornNA87}, volume = 267, year = 1987 }