On Gossip and Populations

DOI10.1007/978-3-642-11476-2_7zbMath1274.68005OpenAlexW1507171077MaRDI QIDQ3408161

Anne-Marie Kermarrec, Yann Busnel, Marin Bertier

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• T-Man: Gossip-based fast overlay topology construction
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• On the complexity of asynchronous gossip
• Peer counting and sampling in overlay networks
• Stably computable predicates are semilinear

This page was built for publication: On Gossip and Populations