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

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

doi:10.1137/0217070

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45100

Näher, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Alt, Helmut
Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K., Näher, S., & Alt, H. (1988). A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing, 17(6), 1093-1102. doi:10.1137/0217070.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE7E-A

Abstract

There is no abstract available