Rearrangeable Networks with Limited Depth

DOI10.1137/0603041MaRDI QIDQ3956854zbMATH OpenOpenAlexFDO

Authors Andrew Chi-Chih Yao, Nicholas 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

simultaneous independent communication pathsswitching systems

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites work

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

Cited in

(12)

• Communication in bounded depth circuits
• Computation of best possible low degree expanders
• Sparse asymmetric connectors in communication networks
• Interactive Communication, Diagnosis and Error Control in Networks
• Multicast Routing and Design of Sparse Connectors
• Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
• scientific article; zbMATH DE number 1334210 (Why is no real title available?)
• Parallel algorithms for routing in nonblocking networks
• Constructions of sparse asymmetric connectors with number theoretic methods
• Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
• On shifting networks
• Construction of asymmetric connectors of depth two

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956854)