On rearrangeable and non-blocking switching networks

DOI10.1016/0022-0000(78)90001-6zbMath0387.94044OpenAlexW2132275736MaRDI QIDQ1250088

Nicholas J. Pippenger

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90001-6

Mathematics Subject Classification ID

Related Items (11)

Construction of asymmetric connectors of depth two ⋮ Lower bounds for non-adaptive shortest path relaxation ⋮ Size bounds for superconcentrators ⋮ An invariant extension method for system area networks of multicore computational systems. An ideal system network ⋮ Constructions of sparse asymmetric connectors with number theoretic methods ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Multicast Routing and Design of Sparse Connectors ⋮ Generalized Clos networks ⋮ Sparse asymmetric connectors in communication networks ⋮ Some Graph-Colouring Theorems with Applications to Generalized Connection Networks ⋮ Rearrangeable Networks with Limited Depth

Cites Work

• Unnamed Item
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• On non-blocking switching networks
• On Crossbar Switching Networks
• A Permutation Network
• On Permutation Switching Networks

This page was built for publication: On rearrangeable and non-blocking switching networks