Randomized broadcast in networks

Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal

Research output: Contribution to journalArticlepeer-review

161 Scopus citations


In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.

Original languageEnglish
Pages (from-to)447-460
Number of pages14
JournalRandom Structures and Algorithms
Issue number4
StatePublished - 1990
Externally publishedYes


  • distributed computation
  • random graphs
  • randomized algorithms
  • rumor propagation


Dive into the research topics of 'Randomized broadcast in networks'. Together they form a unique fingerprint.

Cite this