Pages that link to "Item:Q4132159"
From MaRDI portal
The following pages link to The Indirect Binary n-Cube Microprocessor Array (Q4132159):
Displaying 23 items.
- Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks (Q314752) (← links)
- A theory of decomposition into prime factors of layered interconnection networks (Q531607) (← links)
- Hypercube permutations routable under all dimension orderings (Q671598) (← links)
- Parallel stereocorrelation on a reconfigurable multi-ring network. (Q676250) (← links)
- A reliable and fault-tolerant interconnection network (Q922488) (← links)
- Mapping finite element graphs on hypercubes (Q973427) (← links)
- A unified theory of interconnection network structure (Q1088405) (← links)
- Reliability properties of the hypercube network (Q1102261) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Parallel solution of block tridiagonal linear systems (Q1106615) (← links)
- The number of spanning trees of the generalized Boolean \(n\)-cube network (Q1113880) (← links)
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks (Q1117906) (← links)
- A graph theoretical approach to equivalence of multistage interconnection networks (Q1119597) (← links)
- High density graphs for processor interconnection (Q1153674) (← links)
- Permutations on the block PRAM (Q1209324) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- The number of spanning trees of the generalized hypercube network (Q1802487) (← links)
- Efficient graph automorphism by vertex partitioning (Q1836990) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- A neural sorting network with O(1) time complexity (Q2365819) (← links)
- Permutation-exchange graphs that emulate the binary cube (Q3029048) (← links)
- Time-optimal simulations of networks by universal parallel computers (Q5096148) (← links)