On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj Hromkovic Krzysztof Lorys Przemyslawa Kanarek Ralf Klasing Walter Unger Hubert Wagener On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. 255-266 1995 STACS db/conf/stacs/stacs95.html#HromkovicLKKUW95 http://dx.doi.org/10.1007/3-540-59042-0_78