Space-optimal counting in population protocols

DOI10.1007/978-3-662-48653-5_42MaRDI QIDQ1664170zbMATH OpenOpenAlexFDO

Authors J. Beauquier, J. Burman, Simon Clavière, Devan Sohier

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

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

Recommendations

• Time and space optimal counting in population protocols
• A survey of size counting in population protocols
• Brief announcement: Space-optimal naming in population protocols
• Simple and fast approximate counting and leader election in populations
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks

Cited in

(18)

• Constructing self-stabilizing oscillators in population protocols
• Simple and fast approximate counting and leader election in populations
• Fault-tolerant simulation of population protocols
• Uniform bipartition in the population protocol model with arbitrary graphs
• A survey of size counting in population protocols
• Data collection in population protocols with non-uniformly random scheduler
• Mediated population protocols: leader election and applications
• Time and space optimal counting in population protocols
• Constant-space population protocols for uniform bipartition
• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• On Counting the Population Size
• Brief announcement: Space-optimal naming in population protocols
• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• Space-optimal naming in population protocols
• Efficient computation in congested anonymous dynamic networks
• Complete graph identification in population protocols
• Efficient computation in congested anonymous dynamic networks
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664170)