Parallel Processing with the Perfect Shuffle

Harold S. Stone · IEEE Transactions on Computers · 1971

Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector are interlaced with elements of the second half in the perfect shuffle of the vector.

Cited by 1,245 works. doi:10.1109/t-c.1971.223205

Authors

References