An optimal sorting algorithm for mesh connected computers
Open accessThe DOI matches its Crossref record.
Abstract
In this paper we prove a 3n upper and lower bound on the complexity of sorting on a n × n mesh connected parallel computer, and describe an exceptionally simple algorithm which sorts the array by alternately sorting its rows and columns log log n times.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
“It was shown in [36] that there exists a sorting network on a 2d √ n × √ n lattice which has depth 3 √ n + o( √ n); this is close to optimal by diameter arguments.”
MethodNtru prime: Reducing attack surface at low cost
Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-72565-9_12 · Cited by 177
Metadata
- Authors
- Schnorr, C. P., & Shamir, A.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 255-263
- OpenAlex
- W2012216209
- Cited by
- 197
- References
- 0
- FWCI
- 9.20
- Type
- conference paper
- Language
- en
- Open access
- gold
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: An optimal sorting algorithm for mesh connected computers. https://app.cochat.ai/papers/10.1145/12130.12156
- The paper
- Schnorr, C. P., & Shamir, A. (1986). An optimal sorting algorithm for mesh connected computers. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12156
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.