A theory of decomposition into prime factors of layered interconnection networks
From MaRDI portal
Publication:531607
Recommendations
Cites work
- scientific article; zbMATH DE number 3876584 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- A Permutation Network
- A graph theoretical approach to equivalence of multistage interconnection networks
- A unified theory of interconnection network structure
- Access and Alignment of Data in an Array Processor
- An O (log N ) deterministic packet-routing scheme
- Data Manipulating Functions in Parallel Processors and Their Implementations
- Efficient algorithms for checking the equivalence of multistage interconnection networks
- Layered cross product&mdashA technique to construct interconnection networks
- Local algorithms for the prime factorization of strong product graphs
- On a Class of Multistage Interconnection Networks
- On the Rearrangeability of 2(Iog2N) –1 Stage Permutation Networks
- Permutation Groups, Complexes, and Rearrangeable Connecting Networks
- Quad trees: A data structure for retrieval by composite keys
- The Indirect Binary n-Cube Microprocessor Array
Cited in
(3)
This page was built for publication: A theory of decomposition into prime factors of layered interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531607)