External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

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.

Abstract

Abstract is missing.

runs on