Randomized broadcast in networks
- 1 January 1990
- book chapter
- Published by Springer Nature
- Vol. 1 (4) , 128-137
- https://doi.org/10.1007/3-540-52921-7_62
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Bounds on the cover timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On Spreading a RumorSIAM Journal on Applied Mathematics, 1987
- Epidemic algorithms for replicated database maintenancePublished by Association for Computing Machinery (ACM) ,1987
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Generalization of Epidemic Theory: An Application to the Transmission of IdeasNature, 1964
- Contribution to the mathematical theory of contagion and spread of information: I. Spread through a thoroughly mixed populationBulletin of Mathematical Biology, 1953
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952