On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (Q3583331)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks |
scientific article |
Statements
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (English)
0 references
27 August 2010
0 references
network design and communication
0 references
communication networks
0 references
permutation networks
0 references
switching networks
0 references
parallel algorithms
0 references
