The DOI matches its Crossref record.
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Abstract
This paper assumes a parallel RAM (random access machine) model which allows both concurrent reads and concurrent writes of a global memory. The main result is an optimal randomized parallel algorithm for INTEGER_SORT (i.e., for sorting n integers in the range $[1,n]$). This algorithm costs only logarithmic time and is the first known that is optimal: the product of its time and processor bounds is upper bounded by a linear function of the input size. Also given is a deterministic sublogarithmic time algorithm for prefix sum. In addition this paper presents a sublogarithmic time algorithm for obtaining a random permutation of n elements in parallel. And finally, sublogarithmic time algorithms for GENERAL_SORT and INTEGER_SORT are presented. Our sub-logarithmic GENERAL_SORT algorithm is also optimal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A comparison of sorting algorithms for the connection machine CM-2
Blelloch, G. E., Leiserson, C. E., Maggs, B. M., Plaxton, C. G., Smith, S. J., & Zagha, M. (1991) · Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91 · doi:10.1145/113379.113380 · Cited by 335
Bandwidth-Optimal Random Shuffling for GPUs
Mitchell, R., Stokes, D., Frank, E., & Holmes, G. (2022) · ACM Transactions on Parallel Computing · doi:10.1145/3505287 · Cited by 6
“Miller and Reif [43] and later Rajasekaran and Reif [52] describe a simple method in which a parallel prefix sum is used to perform the compaction.”
Method
Metadata
- Authors
- Rajasekaran, S., & Reif, J. H.
- Venue
- SIAM Journal on Computing
- Published
- 1989-06
- Volume
- 18
- Issue
- 3
- Pages
- 594-607
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2023518480
- Cited by
- 171
- References
- 0
- FWCI
- 12.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. https://app.cochat.ai/papers/10.1137/0218041
- The paper
- Rajasekaran, S., & Reif, J. H. (1989). Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM Journal on Computing. https://doi.org/10.1137/0218041
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.