The Complexity of Parallel Sorting

From MaRDI portal

Revision as of 12:47, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3776649

Jump to:navigation, search

DOI10.1137/0216008zbMath0636.68076OpenAlexW2101292747MaRDI QIDQ3776649

Avi Wigderson, Friedhelm Meyer auf der Heide

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216008

zbMATH Keywords

sorting Ramsey theory lower bound PRAM parallel merge tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (7)

Transforming comparison model lower bounds to the parallel-random-access-machine ⋮ Simulations among concurrent-write PRAMs ⋮ The complexity of parallel prefix problems on small domains ⋮ On the performance of networks with multiple busses ⋮ Disjointness graphs of short polygonal chains ⋮ Choice-memory tradeoff in allocations ⋮ Large parallel machines can be extremely slow for small problems

This page was built for publication: The Complexity of Parallel Sorting

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3776649&oldid=17325212"