Rearrangeable Networks with Limited Depth

DOI10.1137/0603041zbMath0493.94017OpenAlexW2155859297MaRDI QIDQ3956854

Andrew Chi-Chih Yao, Nicholas J. Pippenger

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/137

zbMATH Keywords

switching systemssimultaneous independent communication paths

Mathematics Subject Classification ID

Related Items (12)

Communication in bounded depth circuits ⋮ Parallel algorithms for routing in nonblocking networks ⋮ Construction of asymmetric connectors of depth two ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions ⋮ Computation of best possible low degree expanders ⋮ On shifting networks ⋮ Unnamed Item ⋮ Constructions of sparse asymmetric connectors with number theoretic methods ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Multicast Routing and Design of Sparse Connectors ⋮ Sparse asymmetric connectors in communication networks ⋮ Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

Cites Work

• On rearrangeable and non-blocking switching networks
• A New Lower Bound for the Number of Switches in Rearrangeable Networks
• Shifting Graphs and Their Applications

This page was built for publication: Rearrangeable Networks with Limited Depth