Constant-Space Population Protocols for Uniform Bipartition

DOI10.4230/LIPICS.OPODIS.2017.19zbMath1487.68026OpenAlexW2794950092MaRDI QIDQ3300820

Fukuhito Ooshita, Michiko Inoue, Ken-Ichi Yamaguchi, Hiroto Yasumi

Publication date: 30 July 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/opodis/opodis2017.html#YasumiOYI17

zbMATH Keywords

distributed protocolpopulation protocoluniform bipartition

Mathematics Subject Classification ID

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

Related Items (1)

Uniform bipartition in the population protocol model with arbitrary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple population protocol for fast robust approximate majority
• Loosely-stabilizing leader election in a population protocol model
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks
• Space-optimal counting in population protocols
• The computational power of population protocols
• Realization of periodic functions by self-stabilizing population protocols with synchronous handshakes
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Fast and Exact Majority in Population Protocols
• Deterministic Population Protocols for Exact Majority and Plurality.
• Polylogarithmic-Time Leader Election in Population Protocols
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Time-Space Trade-offs in Population Protocols
• Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers
• Stable leader election in population protocols requires linear time

This page was built for publication: Constant-Space Population Protocols for Uniform Bipartition