On rearrangeable networks of the shuffle-exchange type

Universal multistage networks via linear permutations

Proceedings of the 1991 ACM/IEEE conference on Supercomputing

A lower bound for sorting networks based on the shuffle permutation

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Universality of iterated networks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

On the Rearrangeability of Multistage Networks Employing Uniform Connection Patterns

ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems