A Lower Bound for the Complexity of the Union-Split-Find Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'Kurt Mehlhorn' in GoogleThis author has not been identified. Look up 'Stefan Näher' in GoogleThis author has not been identified. Look up 'Helmut Alt' in Google

runs on WebDSL