In-place permuting and perfect shuffling using involutions

DOI10.1016/j.ipl.2013.02.017zbMath1366.68214arXiv1204.1958OpenAlexW2027252214MaRDI QIDQ396603

Mohammad Hasan, H. S. Yoon

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1958

zbMATH Keywords

combinatorial problemsanalysis of algorithmspermutationparallel algorithmsinvolutionperfect shuffle

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10)

Related Items

Unnamed Item

Cites Work

• Computing the cycles in the perfect shuffle permutation
• Permuting in Place
• How to write a permutation as a product of involutions (and why you might care)
• Algorithms – ESA 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item