On-Line Algorithms for Path Selection in a Nonblocking Network
From MaRDI portal
Publication:4887019
DOI10.1137/S0097539791221499zbMath0852.68004MaRDI QIDQ4887019
Bruce M. Maggs, Frank Thompson Leighton
Publication date: 26 November 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)
Related Items (7)
Parallel algorithms for routing in nonblocking networks ⋮ Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ Real-time emulations of bounded-degree networks ⋮ Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors ⋮ Expander graphs and their applications ⋮ A framework for solving VLSI graph layout problems ⋮ OptORAMa: optimal oblivious RAM
This page was built for publication: On-Line Algorithms for Path Selection in a Nonblocking Network
