论文信息 - Computing the cycles in the perfect shuffle permutation - 字舞流文

Computing the cycles in the perfect shuffle permutation

John A. Ellis | Hongbing Fan | Tobias Krahn | J. Ellis | Hongbing Fan | Tobias Krahn

[1] Jeanne Agnew. Explorations in number theory , 1972 .

[2] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[3] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[4] Faith Ellen,et al. Permuting in Place , 1995, SIAM J. Comput..

[5] Aldous Huxley,et al. Groups of Perfect Shuffles , 1987 .

[6] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[7] Kenneth E. Batcher. Decomposition of Perfect Shuffle Networks , 1991, ICPP.

[8] J. Rosser,et al. Approximate formulas for some functions of prime numbers , 1962 .

[9] William M. Kantor,et al. The mathematics of perfect shuffles , 1983 .

[10] D. A. Burgess. On Character Sums and Primitive Roots , 1962 .

[11] John A. Ellis,et al. In situ, Stable Merging by Way of the Perfect Shuffle , 2000, Comput. J..

[12] Chen Zuchi,et al. Hile-yeh estimates of eigenvalues of polyharmonic operators , 1993 .