Answers are grounded in this paper and cite their sources.
Next article Permutations by Cutting and ShufflingSolomon W. GolombSolomon W. Golombhttps://doi.org/10.1137/1003059PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout Next article FiguresRelatedReferencesCited ByDetails Potentialities and limitations of machine learning to solve cut-and-shuffle mixing problems: A case studyChemical Engineering Science, Vol. 260 | 1 Oct 2022 Cross Ref Finite self-similar sequences, permutation cycles, and music compositionJournal of Mathematics and the Arts, Vol. 4 | 7 September 2022 Cross Ref A New Fast Algorithm for Discrete Fractional Hadamard TransformIEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 66, No. 7 | 1 Jul 2019 Cross Ref Cutting and shuffling a hemisphere: Nonorthogonal axesPhysical Review E, Vol. 99, No. 3 | 7 March 2019 Cross Ref Shuffling matrices, Kronecker product and Discrete Fourier TransformDiscrete Applied Mathematics, Vol. 233 | 1 Dec 2017 Cross Ref Mixing and the fractal geometry of piecewise isometriesPhysical Review E, Vol. 95, No. 4 | 14 April 2017 Cross Ref Mixing with piecewise isometries on a hemispherical shellChaos: An Interdisciplinary Journal of Nonlinear Science, Vol. 26, No. 7 | 1 Jul 2016 Cross Ref CUTTING AND SHUFFLING A LINE SEGMENT: MIXING BY INTERVAL EXCHANGE TRANSFORMATIONSInternational Journal of Bifurcation and Chaos, Vol. 22, No. 12 | 14 January 2013 Cross Ref Kinetics of ring formationPhysical Review E, Vol. 83, No. 6 | 2 June 2011 Cross Ref Mélanges parfaits de cartes (I)Quadrature, Vol. 91, No. 76 | 18 March 2010 Cross Ref Matrix Structures and Parallel Algorithms for Image Superresolution ReconstructionQiang Zhang, Richard T. Guy, and Robert J. PlemmonsSIAM Journal on Matrix Analysis and Applications, Vol. 31, No. 4 | 9 April 2010AbstractPDF (588 KB)Faro Shuffles and the Chinese Remainder TheoremMathematics Magazine, Vol. 80, No. 4 | 16 April 2018 Cross Ref Alternate resolution strategy in multistage interconnection networksParallel Computing, Vol. 20, No. 6 | 1 Jun 1994 Cross Ref Constant geometry fast Fourier transforms on array processorsIEEE Transactions on Computers, Vol. 42, No. 3 | 1 Mar 1993 Cross Ref Design and analysis of even-sized binary shuffle-exchange networks for multiprocessorsIEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 4 | 1 Oct 1991 Cross Ref Large-scale parallel processing systemsMicroprocessors and Microsystems, Vol. 11, No. 1 | 1 Jan 1987 Cross Ref Permuting data with the Omega networkActa Informatica, Vol. 21, No. 6 | 1 Mar 1985 Cross Ref The mathematics of perfect shufflesAdvances in Applied Mathematics, Vol. 4, No. 2 | 1 Jun 1983 Cross Ref A generalization of the perfect shuffleDiscrete Mathematics, Vol. 47 | 1 Jan 1983 Cross Ref Hypertree: A Multiprocessor Interconnection TopologyIEEE Transactions on Computers, Vol. C-30, No. 12 | 1 Dec 1981 Cross Ref The Universality of the Shuffle-Exchange NetworkIEEE Transactions on Computers, Vol. C-30, No. 5 | 1 May 1981 Cross Ref UltracomputersACM Transactions on Programming Languages and Systems, Vol. 2, No. 4 | 1 Oct 1980 Cross Ref A Sampler of Circuit Switching NetworksComputer, Vol. 12, No. 6 | 1 Jun 1979 Cross Ref Interconnection Networks for SIMD MachinesComputer, Vol. 12, No. 6 | 1 Jun 1979 Cross Ref Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used PermutationsIEEE Transactions on Computers, Vol. C-27, No. 7 | 1 Jul 1978 Cross Ref The universality of various types of SIMD machine interconnection networksACM SIGARCH Computer Architecture News, Vol. 5, No. 7 | 17 Mar 1977 Cross Ref Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address MasksIEEE Transactions on Computers, Vol. C-26, No. 2 | 1 Feb 1977 Cross Ref Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, Vol. C-25, No. 5 | 1 May 1976 Cross Ref The generalized faro shuffleDiscrete Mathematics, Vol. 15, No. 4 | 1 Jan 1976 Cross Ref A Shuffle-Exchange Network with Simplified ControlIEEE Transactions on Computers, Vol. C-25, No. 1 | 1 Jan 1976 Cross Ref Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, Vol. C-24, No. 12 | 1 Dec 1975 Cross Ref A Markov Chain Structure for Riff ShufflingJ. R. Doner and V. R. R. UppuluriSIAM Journal on Applied Mathematics, Vol. 18, No. 1 | 31 July 2006AbstractPDF (1468 KB) Volume 3, Issue 4| 1961SIAM Review History Published online:18 July 2006 InformationCopyright © 1961 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1003059Article page range:pp. 293-297ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics
No takes yet. Share an insight, caveat, or question.
Solomon W. Golomb (1961) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: