Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
DOI10.1137/0218041zbMATH Open0679.68091DBLPjournals/siamcomp/RajasekaranR89OpenAlexW2023518480WikidataQ61772707 ScholiaQ61772707MaRDI QIDQ4729356FDOQ4729356
Authors: Sanguthevar Rajasekaran, J. Reif 
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4cc4c340e309cd50fcdd6715d9e77e39de353683
Recommendations
optimal algorithmsrandom permutationsprefix sumparallel RAMradix sortrandomized parallel sorting algorithms
Cited In (38)
- 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
- Fast integer merging on the EREW PRAM
- Optimal parallel algorithms for forest and term matching
- A randomized parallel sorting algorithm with an experimental study
- Improved fast integer sorting in linear space
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS
- Improved parallel integer sorting without concurrent writing
- Title not available (Why is that?)
- More Efficient Parallel Integer Sorting
- An optimal parallel algorithm for sorting multisets
- A unified \(O(\log N)\) and optimal sorting vector algorithm
- Optimal parallel algorithms for multiple updates of minimum spanning trees
- Title not available (Why is that?)
- Sorting in Average Time $o(\log \,n)$
- A randomized sorting algorithm on the BSP model
- 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
- 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
- Title not available (Why is that?)
- 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
Uses Software
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)
