Simple, Fast and Deterministic Gossip and Rumor Spreading
Work
Year: 2015
Type: article
Abstract: We study gossip algorithms for the rumor spreading problem, which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call one neighbor per roun... more
Source: Journal of the ACM
Author Bernhard Haeupler
Institution Massachusetts Institute of Technology
Cites: 25
Cited by: 25
Related to: 10
FWCI: 2.948
Citation percentile (by year/subfield): 90.82
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green