English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting

MPS-Authors
/persons/resource/persons44564

Hagerup,  Torben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45250

Raman,  Rajeev
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., & Raman, R. (1992). Waste Makes Haste: Tight Bounds for Loose Parallel Sorting. In Proceedings of the 33th Annual IEEE Symposium on Foundations of Computer Science (pp. 628-637). New York, NY, USA: IEEE.


Cite as: https://hdl.handle.net/21.11116/0000-000E-4CC4-0
Abstract
There is no abstract available