Population protocols with faulty interactions: the impact of a leader

DOI10.1016/j.tcs.2018.09.005zbMath1407.68058arXiv1611.06864OpenAlexW2891053194MaRDI QIDQ1628589

Giovanni Viglietta, Tomoko Izumi, Taisuke Izumi, Nicola Santoro, Paola Flocchini, Giuseppe Antonio Di Luna

Publication date: 4 December 2018

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.06864

zbMATH Keywords

population protocolsomission failurestwo-way simulation

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (9)

Population protocols with faulty interactions: the impact of a leader ⋮ Simple and fast approximate counting and leader election in populations ⋮ Unnamed Item ⋮ Population protocols with unreliable communication ⋮ Fault tolerant network constructors ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Protocols with constant local storage and unreliable communication ⋮ Fault-tolerant simulation of population protocols ⋮ Mediated Population Protocols: Leader Election and Applications

Cites Work

• Unnamed Item
• A simple population protocol for fast robust approximate majority
• Mediated population protocols
• A self-stabilizing transformer for population protocols with covering
• Passively mobile communicating machines that use restricted space
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• On the convergence of population protocols when population goes to infinity
• Population protocols with faulty interactions: the impact of a leader
• Space-optimal counting in population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Fast and Exact Majority in Population Protocols
• Mediated Population Protocols: Leader Election and Applications
• Polylogarithmic-Time Leader Election in Population Protocols
• Fast Computation by Population Protocols with a Leader
• The Dynamics of Probabilistic Population Protocols
• All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model
• Stably computable predicates are semilinear
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Speed Faults in Computation by Chemical Reaction Networks

This page was built for publication: Population protocols with faulty interactions: the impact of a leader