On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
From MaRDI portal
Publication:5633915
DOI10.1002/j.1538-7305.1971.tb02569.xzbMath0226.94025OpenAlexW2109810893MaRDI QIDQ5633915
Publication date: 1971
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1971.tb02570.x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Rearrangeability of bit permutation networks ⋮ Communication structures in fault‐tolerant distributed systems ⋮ Applications of matching and edge‐coloring algorithms to routing in clos networks ⋮ Shorter arithmetization of nondeterministic computations
This page was built for publication: On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
