The gossip problem

@article{Berman1973TheGP,
  title={The gossip problem},
  author={Gerald Berman},
  journal={Discrete Mathematics},
  year={1973},
  volume={4},
  pages={91}
}
A very simple solution can be given to the gossip problem [1] which may be formulated as follows: There are n gossips each of which knows some gossip not known to the others. They communicate by telephone, and whenever one gossip calls another, they tell each other all they know at that time. How many calls are required before each gossip knows everything? 

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Gossips and telephones

  • Discrete Mathematics
  • 1972
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Fault tolerance in sensor networks: Performance comparison of some gossip algorithms

  • 2009 Seventh Workshop on Intelligent solutions in Embedded Systems
  • 2009
VIEW 1 EXCERPT
CITES METHODS

Comparison of Averaging Algorithms for Wireless Sensor Networks

  • 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications
  • 2008
VIEW 1 EXCERPT
CITES METHODS

Communication Complexity of Group Key Distribution

  • ACM Conference on Computer and Communications Security
  • 1998

The partial gossiping problem

  • Discrete Mathematics
  • 1996
VIEW 1 EXCERPT

Set to Set Broadcasting in Communication Networks

  • Discrete Applied Mathematics
  • 1992
VIEW 2 EXCERPTS
CITES METHODS