Technical Report CS0489

Title: On the Shffle-Exchange Network as a Permutations Generator
Authors: Tuvi Etzion
Abstract: This paper consider che shuffle-exchange network as a permutations generator. We present a proof that the N! permutations can be generated using N! passes in the network. We give efficient algorithms for generating a few intersting classes of permutations, namely bit-permute permutations, 'bit-permute-complement permutations, row cyclic shifts, and classes of derangements, in the minimal passes which are possible to generate these classes of permutations in the network.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1988
To the main CS technical reports page

Computer science department, Technion