Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
From MaRDI portal
Recommendations
Cited in
(40)- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
- ERCW PRAMs and optical communication
- Improved deterministic parallel integer sorting
- On parallel integer sorting
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Fast integer merging on the EREW PRAM
- Optimal parallel algorithms for forest and term matching
- Fast integer merging on the EREW PRAM
- A randomized parallel sorting algorithm with an experimental study
- Improved fast integer sorting in linear space
- Improved parallel integer sorting without concurrent writing
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
- An optimal parallel algorithm for sorting multisets
- scientific article; zbMATH DE number 176751 (Why is no real title available?)
- More Efficient Parallel Integer Sorting
- A unified \(O(\log N)\) and optimal sorting vector algorithm
- Optimal parallel algorithms for multiple updates of minimum spanning trees
- scientific article; zbMATH DE number 4090816 (Why is no real title available?)
- Sorting in Average Time o(\log \,n)
- A randomized sorting algorithm on the BSP model
- A parallel batch-dynamic data structure for the closest pair problem
- Conservative algorithms for parallel and sequential integer sorting
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- Delayed path coupling and generating random permutations
- Ultrafast Expected Time Parallel Algorithms
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima
- Probabilistic Parallel Algorithms for Sorting and Selection
- Improved parallel construction of wavelet trees and rank/select structures
- Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
- scientific article; zbMATH DE number 4043263 (Why is no real title available?)
- Parallel integer sorting using small operations
- The parallel complexity of integer prefix summation
- Dynamic point location in arrangements of hyperplanes
- Probabilistic integer sorting
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon
- RANDOMIZED SORTING ON THE POPS NETWORK
- Parallel Weighted Random Sampling
- Tight Bounds on the Complexity of Parallel Sorting
- Deterministic parallel list ranking
- Parallel interval order recognition and construction of interval representations
This page was built for publication: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729356)
