Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks
IEEE Transactions on Parallel and Distributed Systems
Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages
IEEE Transactions on Computers
Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks
IEEE Transactions on Computers
On the Rearrangeability of Multistage Networks Employing Uniform Connection Patterns
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Array organization in parallel memories
International Journal of Parallel Programming
Rearrangeability of bit permutation networks
Theoretical Computer Science
A method of batching conflict routings in shuffle-exchange networks
Theoretical Computer Science
| Hi-index | 0.01 |