IEEE Transactions on Computers · 1971 · 1.3K citations · 8 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingData ParallelismParallel SortingPermutation PatternsData ShufflingPerfect Shuffle TopologyShuffleVector Processing
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.
8
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
C. A. R. Hoare · Communications of the ACM · 1961 · 539 citations
Greg Barnes, Rebecca M. Brown, M. Kato et al. · IEEE Transactions on Computers · 1968 · 526 citations