Optimal Rearrangeable Multistage Connecting Networks
From MaRDI portal
Cited in
(26)- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- A universal tree-based network with the minimum number of reticulations
- Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
- Secret-shared shuffle
- The blocking probability of spider-web networks
- Interactive Communication, Diagnosis and Error Control in Networks
- scientific article; zbMATH DE number 1334210 (Why is no real title available?)
- Parallel algorithms for routing in nonblocking networks
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Optimal three-dimensional VLSI layouts
- Memoryless computation: new results, constructions, and extensions
- Non-binary universal tree-based networks
- On the benefit of supporting virtual channels in wormhole routers
- Good permutation codes based on the shuffle-exchange network
- Arithmetic circuits, structured matrices and (not so) deep learning
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts
- Ramp hyper-invertible matrices and their applications to MPC protocols
- New graph decompositions with applications to emulations
- Efficient permutation correlations and batched random access for two-party computation
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- Secret-shared shuffle from authenticated correlations
- Construction of asymmetric connectors of depth two
- A lower bound on the area of permutation layouts
- Area-time tradeoffs for universal VLSI circuits
- Reductions for monotone Boolean circuits
This page was built for publication: Optimal Rearrangeable Multistage Connecting Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338469)
