Frames: a simple characterization of permutations realized by frequently used networks
From MaRDI portal
Publication:4419700
DOI10.1109/12.381954zbMath1068.68533OpenAlexW1972735249MaRDI QIDQ4419700
Publication date: 14 October 2003
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/ecetr/309
Related Items (2)
Rearrangeability of bit permutation networks ⋮ Balanced permutations and multistage interconnection networks
This page was built for publication: Frames: a simple characterization of permutations realized by frequently used networks