Recent Advances in Population Protocols

DOI10.1007/978-3-642-03816-7_6zbMath1250.68071OpenAlexW1524178480WikidataQ57608094 ScholiaQ57608094MaRDI QIDQ3182913

Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_6

Mathematics Subject Classification ID

Network protocols (68M12) Agent technology and artificial intelligence (68T42)

Related Items (5)

The computational power of simple protocols for self-awareness on graphs ⋮ On space complexity of self-stabilizing leader election in mediated population protocol ⋮ Passively mobile communicating machines that use restricted space ⋮ Computational models for networks of tiny artifacts: a survey ⋮ Mediated population protocols

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of population protocols when population goes to infinity
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Semigroups, Presburger formulas, and languages
• The Dynamics of Probabilistic Population Protocols
• Mediated Population Protocols
• Stably computable predicates are semilinear
• Self-stabilizing counting in mobile sensor networks
• Computation in networks of passively mobile finite-state sensors

This page was built for publication: Recent Advances in Population Protocols