The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Parallel Processing with the Perfect Shuffle
Abstract
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector are interlaced with elements of the second half in the perfect shuffle of the vector.
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
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Sorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
Hoare, C. A. R. (1961) · Communications of the ACM · doi:10.1145/366622.366644 · Cited by 537
An Adaptation of the Fast Fourier Transform for Parallel Processing
Pease, M. C. (1968) · Journal of the ACM · doi:10.1145/321450.321457 · Cited by 381
Floyd, R. W. (1964) · Communications of the ACM · doi:10.1145/355588.365103 · Cited by 242
Cited by
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
A group-theoretic model for symmetric interconnection networks
Akers, S. B., & Krishnamurthy, B. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21148 · Cited by 1,231
Optical interconnections for VLSI systems
Goodman, J. W., Leonberger, F. J., Kung, S.-Y., & Athale, R. A. (1984) · Proceedings of the IEEE · doi:10.1109/proc.1984.12943 · Cited by 1,052
Performance analysis of k-ary n-cube interconnection networks
Dally, W. J. (1990) · IEEE Transactions on Computers · doi:10.1109/12.53599 · Cited by 887
Generalized Hypercube and Hyperbus Structures for a Computer Network
Bhuyan, & Agrawal (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676437 · Cited by 855
Metadata
- Authors
- Stone, H. S.
- Venue
- IEEE Transactions on Computers
- Published
- 1971-02
- Volume
- C-20
- Issue
- 2
- Pages
- 153-161
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W1976284552
- Cited by
- 1,245
- References
- 5
- FWCI
- 5.02
- 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
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.