Hypercube sandwich approach to conferencing.

DOI10.1007/BF00130110MaRDI QIDQ676254zbMATH OpenFDO

Authors Joanne F. Houlahan, Leonore J. Cowen, Gerald M. Masson

Publication date 7 August 1997

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00130110

Mathematics Subject Classification ID

Computer system organization (68M99)

Cites work

• A new lower bound for snake-in-the-box codes
• Broadcast ring sandwich networks
• How robust is the n-cube?
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3256966 (Why is no real title available?)
• 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
• On non-blocking switching networks
• On Nonblocking Multiconnection Networks
• On the snake in the box problem
• Rearrangeability of multi‐connection three‐stage clos networks
• The Bay Restaurant--A Linear Storage Problem
• Three-Stage Multiconnection Networks Which Are Nonblocking in the Wide Sense
• Wide-Sense Nonblocking Networks

Cited in

(1)

• Hypercube sandwich approach to conferencing.

This page was built for publication: Hypercube sandwich approach to conferencing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676254)