Parallel comparison merging of many-ordered lists
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4074508 (Why is no real title available?)
- Finding an Approximate Maximum
- Finding the maximum, merging, and sorting in a parallel computation model
- Parallel Merge Sort
- Parallel Sorting with Constant Time for Comparisons
- Parallel selection
- Parallel sorting
- Parallelism in Comparison Problems
- Searching, Merging, and Sorting in Parallel Computation
- Sorting and Merging in Rounds
- Sorting and Selecting in Rounds
- Sorting in \(c \log n\) parallel steps
- Sorting, Approximate Sorting, and Searching in Rounds
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
- The average-case parallel complexity of sorting
- Tight Comparison Bounds on the Complexity of Parallel Sorting
Cited in
(6)- Parallel merging: Algorithm and implementation results
- Listing combinatorial objects in parallel
- scientific article; zbMATH DE number 3868588 (Why is no real title available?)
- Direct-chaining with coalescing lists
- scientific article; zbMATH DE number 3949727 (Why is no real title available?)
- On the average running time of odd-even merge sort
This page was built for publication: Parallel comparison merging of many-ordered lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807015)
