Hypercube sandwich approach to conferencing.
From MaRDI portal
Publication:676254
DOI10.1007/BF00130110zbMath1067.68527MaRDI QIDQ676254
Leonore J. Cowen, Gerald M. Masson, Joanne F. Houlahan
Publication date: 7 August 1997
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Hypercube sandwich approach to conferencing.
- Note on an extremal problem arising for unreliable networks in parallel computing
- On a problem of Yuzvinsky on separating the n-cube
- How robust is the n-cube?
- On the snake in the box problem
- A new lower bound for snake-in-the-box codes
- On Nonblocking Multiconnection Networks
- Wide-Sense Nonblocking Networks
- Three-Stage Multiconnection Networks Which Are Nonblocking in the Wide Sense
- On non-blocking switching networks
- Broadcast ring sandwich networks
- The Bay Restaurant--A Linear Storage Problem
- Rearrangeability of multi‐connection three‐stage clos networks
This page was built for publication: Hypercube sandwich approach to conferencing.
