On parallel integer sorting
From MaRDI portal
Publication:805234
DOI10.1007/BF01178563zbMath0728.68066MaRDI QIDQ805234
Sandeep Sen, Sanguthevar Rajasekaran
Publication date: 1992
Published in: Acta Informatica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)
Related Items
Parallel integer sorting using small operations, Probabilistic integer sorting, Improved parallel integer sorting without concurrent writing, Conservative algorithms for parallel and sequential integer sorting, An improved reliability bound of a probabilistic parallel integer sorting algorithm, Improved nonconservative sequential and parallel integer sorting, Optimal randomized parallel algorithms for computational geometry, RANDOMIZED SORTING ON THE POPS NETWORK, More Efficient Parallel Integer Sorting, Improved fast integer sorting in linear space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for sorting integers on random access machines
- Sorting in \(c \log n\) parallel steps
- Towards optimal parallel bucket sorting
- An optimally efficient selection algorithm
- Hybridsort revisited and parallelized
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Efficient parallel algorithms for graph problems
- Parallel iterated bucket sort
- Faster optimal parallel prefix sums and list ranking
- Probabilistic Parallel Algorithms for Sorting and Selection
- Parallel Merge Sort
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Internal Sorting by Radix Plus Sifting
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
