On the complexity of asynchronous gossip

DOI10.1145/1400751.1400771zbMath1301.68160OpenAlexW2151350366MaRDI QIDQ2934340

Chryssis Georgiou, Dariusz R. Kowalski, Rachid Guerraoui

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/124981

zbMATH Keywords

complexityrandomizationconsensusepidemicasynchronygossipadaptive versus oblivious adversary

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Order optimal information spreading using algebraic gossip ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Unnamed Item ⋮ On Gossip and Populations

This page was built for publication: On the complexity of asynchronous gossip