Tight Comparison Bounds on the Complexity of Parallel Sorting
From MaRDI portal
Recommendations
Cited in
(25)- On Parallel Searching
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
- The Complexity of Parallel Sorting
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- scientific article; zbMATH DE number 3926257 (Why is no real title available?)
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Sorting in rounds
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
- Transforming comparison model lower bounds to the parallel-random-access-machine
- Comparing algorithms for sorting with t stacks in series
- Peculiarities of the parallel sorting algorithm with rank formation
- scientific article; zbMATH DE number 5182609 (Why is no real title available?)
- The average-case parallel complexity of sorting
- Parallel comparison algorithms for approximation problems
- Parallel complexity of sorting problems
- Parallel selection
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- Space and time complexities of balanced sorting on processor arrays
- A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
- Sorting roughly sorted sequences in parallel
- Randomized range-maxima in nearly-constant parallel time
- Counting clique trees and computing perfect elimination schemes in parallel
- scientific article; zbMATH DE number 4201596 (Why is no real title available?)
- Parallel comparison merging of many-ordered lists
- Tight Bounds on the Complexity of Parallel Sorting
This page was built for publication: Tight Comparison 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 Q3801082)
