articleTop 10% cited
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers · 1971 · Vol. C-20(2) · pp. 153–161
Harold S. Stone✉(Stanford University)
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.
Coding theory and cryptographyAlgorithms and Data Compressiongraph theory and CDMA systemsPermutation (music)Computer scienceCombinatoricsVector spaceMathematicsArithmeticParallel computingAlgorithmDiscrete mathematicsPhysics
Citations
1,254
FWCI
17.76
field-weighted impact
References
8
Percentile
99%
vs. same field & year
Citations per year
Cited by
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers · 1975 · 1,120 citations
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers · 1981 · 713 citations
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers · 1987 · 2,038 citations
Fat-trees: Universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers · 1985 · 1,314 citations
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers · 1984 · 851 citations
Performance analysis of k-ary n-cube interconnection networks
IEEE Transactions on Computers · 1990 · 884 citations
References
The ILLIAC IV Computer
IEEE Transactions on Computers · 1968 · 525 citations
An algorithm for the machine calculation of complex Fourier series
Mathematics of Computation · 1965 · 12,024 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.