The Complexity of Parallel Sorting
From MaRDI portal
Recommendations
Cited in
(23)- Tight Comparison Bounds on the Complexity of Parallel Sorting
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
- Disjointness graphs of short polygonal chains
- Parallel Sorting with Limited Bandwidth
- Sorting in rounds
- The complexity of parallel prefix problems on small domains
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Peculiarities of the parallel sorting algorithm with rank formation
- The average-case parallel complexity of sorting
- Parallel complexity of sorting problems
- Space and time complexities of balanced sorting on processor arrays
- Routing, merging, and sorting on parallel models of computation
- Simulations among concurrent-write PRAMs
- scientific article; zbMATH DE number 4060722 (Why is no real title available?)
- On the performance of networks with multiple busses
- Communication complexity of PRAMs
- Parallelism in tape-sorting
- Conway's parallel sorting algorithm
- Choice-memory tradeoff in allocations
- On a compaction theorem of Ragde
- Permutations on the block PRAM
- Large parallel machines can be extremely slow for small problems
- Tight Bounds on the Complexity of Parallel Sorting
This page was built for publication: The Complexity of Parallel Sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776649)
