On the number of rounds necessary to disseminate information
- 1 March 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 318-327
- https://doi.org/10.1145/72935.72969
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- Minimum Broadcast TreesIEEE Transactions on Computers, 1981
- Gossips and telegraphsJournal of the Franklin Institute, 1979
- New gossips and telephonesDiscrete Mathematics, 1975
- A Cure for the Telephone DiseaseCanadian Mathematical Bulletin, 1972
- Gossips and telephonesDiscrete Mathematics, 1972
- Combinatorial MathematicsPublished by American Mathematical Society (AMS) ,1963