Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum

Hagerup, Torben

doi:10.1145/195058.195202

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum

MPS-Authors

/persons/resource/persons44564

Hagerup, Torben
Algorithms and Complexity, MPI for Informatics, 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

Hagerup, T. (1994). Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (pp. 382-391). New York, NY: ACM.

Cite as: https://hdl.handle.net/21.11116/0000-000E-4A20-B

Abstract

There is no abstract available