A generalization of the perfect shuffle
From MaRDI portal
Publication:790111
DOI10.1016/0012-365X(83)90100-0zbMATH Open0534.05002MaRDI QIDQ790111FDOQ790111
Authors: Christian Ronse 
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- The generalized faro shuffle
- Parallel Processing with the Perfect Shuffle
- Access and Alignment of Data in an Array Processor
- Kronecker products and shuffle algebra
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
- Rotator design
- Realization of graceful permutation by a shuffle-exchange network
- Permutations by Cutting and Shuffling
- Optimization of Cost and Delay in Cellular Permutation Networks
- Dynamic Memories with Enhanced Data Access
Cited In (15)
- In-place permuting and perfect shuffling using involutions
- An efficient pairing-based shuffle argument
- Perfect Shuffles through Dynamical Systems
- The Word and Conjugacy Problem for Shuffle Groups
- A note on domino shuffling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect shuffling by lazy swaps
- A look at generalized perfect shuffles
- Commutative permutations which occur during card shuffling
- Shuffling matrices, Kronecker product and discrete Fourier transform
- Title not available (Why is that?)
- Generalized shuffle permutations on Boolean cubes
- Rapid mixing of dealer shuffles and clumpy shuffles
- Moving Card i to Position j with Perfect Shuffles
This page was built for publication: A generalization of the perfect shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790111)
