Optimal Rearrangeable Multistage Connecting Networks
From MaRDI portal
Publication:5338469
DOI10.1002/j.1538-7305.1964.tb04103.xzbMath0129.30803OpenAlexW2114870379MaRDI QIDQ5338469
Publication date: 1964
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1964.tb04103.x
Related Items
Constant-slowdown simulations of normal hypercube algorithms on the butterfly network ⋮ Parallel algorithms for routing in nonblocking networks ⋮ Optimal book embeddings of the FFT, Benes, and barrel shifter networks ⋮ Construction of asymmetric connectors of depth two ⋮ Non-binary universal tree-based networks ⋮ 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 ⋮ Secret-shared shuffle ⋮ A lower bound on the area of permutation layouts ⋮ Memoryless computation: new results, constructions, and extensions ⋮ Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers ⋮ New graph decompositions with applications to emulations ⋮ Area-time tradeoffs for universal VLSI circuits ⋮ Reductions for monotone Boolean circuits ⋮ Unnamed Item ⋮ On the benefit of supporting virtual channels in wormhole routers ⋮ The blocking probability of spider-web networks ⋮ A universal tree-based network with the minimum number of reticulations ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design ⋮ Optimal three-dimensional VLSI layouts
