Computing the cycles in the perfect shuffle permutation

DOI10.1016/S0020-0190(00)00103-4zbMath0953.68636WikidataQ128121497 ScholiaQ128121497MaRDI QIDQ1583295

R. Smith

Publication date: 26 October 2000

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

zbMATH Keywords

in-placeperfect shuffle permutation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items

Strictly in-place algorithms for permuting and inverting permutations ⋮ Finite self-similar sequences, permutation cycles, and music composition ⋮ In-place permuting and perfect shuffling using involutions ⋮ Mock characters and the Kronecker symbol ⋮ Criteria for apwenian sequences

Cites Work

• The mathematics of perfect shuffles
• Approximate formulas for some functions of prime numbers
• On Character Sums and Primitive Roots^†
• Groups of Perfect Shuffles
• Permuting in Place
• Parallel Processing with the Perfect Shuffle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the cycles in the perfect shuffle permutation