Tight Bounds on the Complexity of Parallel Sorting
From MaRDI portal
Recommendations
- Tight Comparison Bounds on the Complexity of Parallel Sorting
- Parallel complexity of sorting problems
- The Complexity of Parallel Sorting
- A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- The average-case parallel complexity of sorting
- Time lower bounds for parallel sorting on a mesh-connected processor array
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
- Highly parallelizable problems on sorted intervals
- Parallel sorting revisited
Cited in
(48)- Tight Comparison Bounds on the Complexity of Parallel Sorting
- Towards optimal parallel bucket sorting
- Sorting in constant number of row and column phases on a mesh
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
- Faster deterministic sorting through better sampling.
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Parallel Sorting with Limited Bandwidth
- Time lower bounds for parallel sorting on a mesh-connected processor array
- Sorting in rounds
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
- MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
- An efficient multiway merging algorithm
- Theoretical Aspects of VLSI Pin Limitations
- Peculiarities of the parallel sorting algorithm with rank formation
- Time-complexity of shear sort
- Periodic comparator networks
- A note on adaptive parallel sorting
- Constructing sorting networks from k-sorters
- More Efficient Parallel Integer Sorting
- Real-time emulations of bounded-degree networks
- Sloping-and-shaking
- A unified \(O(\log N)\) and optimal sorting vector algorithm
- A randomized sorting algorithm on the BSP model
- Space and time complexities of balanced sorting on processor arrays
- scientific article; zbMATH DE number 3940717 (Why is no real title available?)
- An efficient parallel algorithm for random sampling
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
- Oblivious parallel tight compaction
- A note on the token distribution problem
- Methods for message routing in parallel machines
- Algorithms for parallel memory, I: Two-level memories
- Minimum Storage Sorting Networks
- Braking the (n^ 2 n) barrier for sorting with faults
- A sorting network on trees
- Recursively divisible problems
- Improved upper bounds on Shellsort
- Parallel integer sorting using small operations
- Towards a better understanding of pure packet routing
- Representing shared data on distributed-memory parallel computers
- Counting clique trees and computing perfect elimination schemes in parallel
- Area efficient layouts of the Batcher sorting networks
- Towards simpler sorting networks and monotone circuits for majority
- Improved bounds for integer sorting in the EREW PRAM model
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
- The complexity of deterministic PRAM simulation on distributed memory machines
- On the theory of interconnection networks for parallel computers
This page was built for publication: Tight Bounds on the Complexity of Parallel Sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219774)
