The Indirect Binary n-Cube Microprocessor Array
From MaRDI portal
Cited in
(26)- A unified theory of interconnection network structure
- Reliability properties of the hypercube network
- How robust is the n-cube?
- Parallel solution of block tridiagonal linear systems
- The number of spanning trees of the generalized Boolean \(n\)-cube network
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
- A graph theoretical approach to equivalence of multistage interconnection networks
- High density graphs for processor interconnection
- Permutations on the block PRAM
- A local-sparing design methodology for fault-tolerant multiprocessors
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- The number of spanning trees of the generalized hypercube network
- Efficient graph automorphism by vertex partitioning
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- A neural sorting network with O(1) time complexity
- Permutation-exchange graphs that emulate the binary cube
- Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks
- Universality of iterated networks
- Distributed algorithms for maximum cliques
- Time-optimal simulations of networks by universal parallel computers
- A theory of decomposition into prime factors of layered interconnection networks
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- Hypercube permutations routable under all dimension orderings
- Parallel stereocorrelation on a reconfigurable multi-ring network.
- A reliable and fault-tolerant interconnection network
- Mapping finite element graphs on hypercubes
This page was built for publication: The Indirect Binary n-Cube Microprocessor Array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132159)
