On the complexity of an optimal non-blocking commutation scheme without reorganization
From MaRDI portal
Publication:1226470
zbMath0327.94051MaRDI QIDQ1226470
L. A. Bassalygo, M. S. Pinsker
Publication date: 1973
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
Methods for message routing in parallel machines, Towards a better understanding of pure packet routing, Explicit expanding expanders, Expanders and Diffusers, Real-time emulations of bounded-degree networks, Explicit Concentrators from Generalized N-Gons, Expander graphs and their applications, Meeting the deadline: on the complexity of fault-tolerant continuous gossip, On the spectral gap and the diameter of Cayley graphs, Some ``good properties of LDA lattices, Pseudo-random graphs and bit probe schemes with one-sided error, Cutoff phenomena for random walks on random regular graphs, On rearrangeable and non-blocking switching networks, Time-space trade-offs in a pebble game
