A generalization of the perfect shuffle
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- Access and Alignment of Data in an Array Processor
- Dynamic Memories with Enhanced Data Access
- Kronecker products and shuffle algebra
- Optimization of Cost and Delay in Cellular Permutation Networks
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
- Parallel Processing with the Perfect Shuffle
- Permutations by Cutting and Shuffling
- Realization of graceful permutation by a shuffle-exchange network
- Rotator design
- The generalized faro shuffle
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
- scientific article; zbMATH DE number 1808170 (Why is no real title available?)
- scientific article; zbMATH DE number 3902068 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3872370 (Why is no real title available?)
- 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)
