J. Agnew, Explorations in Number Theory, 1972.

]. A. Bak84 and . Baker, A concise introduction to the theory of numbers, 1984.

]. K. Bat91 and . Batcher, Decomposition of perfect shuffle networks, Proceedings of the 1991 International Conference on Parallel Processing, pp.255-262, 1991.

R. [. Diaconis, W. Graham, and . Kantor, The mathematics of perfect shuffles, Advances in Applied Mathematics, vol.4, issue.2, pp.175-196, 1983.
DOI : 10.1016/0196-8858(83)90009-X

J. Ellis, T. Krahn, and H. Fan, Computing the cycles in the perfect shuffle permutation, Information Processing Letters, vol.75, issue.5, pp.217-224, 2000.
DOI : 10.1016/S0020-0190(00)00103-4

J. Ellis and M. Markov, In situ, Stable Merging by Way of the Perfect Shuffle, The Computer Journal, vol.43, issue.1, pp.40-53, 2000.
DOI : 10.1093/comjnl/43.1.40

E. Faith, J. I. Fich, P. V. Munro, and . Poblete, Permuting in place, SIAM Journal on Computing, vol.24, issue.2, pp.266-278, 1995.

]. I. Her75 and . Herstein, Topics in Algebra, 1975.

E. [. Hardy and . Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1960.
DOI : 10.1090/S0002-9904-1929-04793-1

]. D. Knu73 and . Knuth, Addison-Wesley series in computer science and information processing, The Art of Computer Programming, 1973.

]. D. Knu81 and . Knuth, Addison-Wesley series in computer science and information processing, The Art of Computer Programming, 1981.

]. F. Lei92 and . Leighton, Introduction to Parallel Algorithms and Architectures, 1992.

K. [. Medvedoff and . Morrison, Groups of Perfect Shuffles, Mathematics Magazine, vol.60, issue.1, pp.3-14, 1987.
DOI : 10.2307/2690131

]. H. Sto71 and . Stone, Parallel processing with the perfect shuffle, IEEE Transactions on Computers, issue.2, pp.20153-161, 1971.

J. Von, Z. Gathen, and J. Gerhard, Modern Computer Algebra, 1999.