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

Local TagsRelease HistoryDetailsSummary

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

Mehlhorn, K., Näher, S., & Alt, H. (1986). A Lower Bound for the Complexity of the Union-Split-Find Problem.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AED3-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AED4-8

Genre: Other

show

show

hide

Creators:
Mehlhorn, Kurt¹, Author
Näher, Stefan¹, Author
Alt, Helmut², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2Max Planck Society, ou_persistent13

show

show

hide

Language(s): eng - English

Dates: Modified: 2006-11-02Date issued: 1986

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344625
Other: Local-ID: C1256428004B93B8-224FAC398455B63AC12571C2004F90CE-mehlhorn86r

Degree: -

show

show

show

show