Space-optimal counting in population protocols

DOI10.1007/978-3-662-48653-5_42zbMath1394.68030OpenAlexW2401955682MaRDI QIDQ1664170

Devan Sohier, Simon Clavière, Joffroy Beauquier, Janna Burman

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_42

Mathematics Subject Classification ID

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

Related Items (11)

Population protocols with faulty interactions: the impact of a leader ⋮ Simple and fast approximate counting and leader election in populations ⋮ Constant-Space Population Protocols for Uniform Bipartition ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Fault-tolerant simulation of population protocols ⋮ Mediated Population Protocols: Leader Election and Applications ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ A survey of size counting in population protocols ⋮ Constructing self-stabilizing oscillators in population protocols ⋮ Stable leader election in population protocols requires linear time ⋮ Data collection in population protocols with non-uniformly random scheduler

This page was built for publication: Space-optimal counting in population protocols