Optimal broadcasting in faulty hypercubes
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fast Gossiping for the HypercubeSIAM Journal on Computing, 1992
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Optimal and near-optimal broadcast in random graphsDiscrete Applied Mathematics, 1989
- Fast computation using faulty hypercubesPublished by Association for Computing Machinery (ACM) ,1989
- Reliable broadcast in hypercube multicomputersIEEE Transactions on Computers, 1988
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Broadcasting with random faultsDiscrete Applied Mathematics, 1988
- Telephone Problems with FailuresSIAM Journal on Algebraic Discrete Methods, 1986
- The cosmic cubeCommunications of the ACM, 1985