Computing the cycles in the perfect shuffle permutation

DOI10.1016/S0020-0190(00)00103-4MaRDI QIDQ1583295zbMATH OpenWikidataFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3874638 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 1437310 (Why is no real title available?)
• scientific article; zbMATH DE number 3237990 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Approximate formulas for some functions of prime numbers
• Groups of Perfect Shuffles
• On Character Sums and Primitive Roots^†
• Parallel Processing with the Perfect Shuffle
• Permuting in Place
• The mathematics of perfect shuffles

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583295)