Fast space optimal leader election in population protocols

L Gasieniec, G Stachowiak - arXiv preprint arXiv:1704.07649, 2017 - arxiv.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …

A time and space optimal stable population protocol solving exact majority

D Doty, M Eftekhari, L Gąsieniec… - 2021 IEEE 62nd …, 2022 - ieeexplore.ieee.org
We study population protocols, a model of distributed computing appropriate for modeling
well-mixed chemical reaction networks and other physical systems where agents exchange …

Enhanced phase clocks, population protocols, and fast space optimal leader election

L Gąsieniec, G Stachowiak - Journal of the ACM (JACM), 2020 - dl.acm.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …

Time and space optimal counting in population protocols

J Aspnes, J Beauquier, J Burman, D Sohier - arXiv preprint arXiv …, 2016 - arxiv.org
This work concerns the general issue of combined optimality in terms of time and space
complexity. In this context, we study the problem of (exact) counting resource-limited and …

A survey of size counting in population protocols

D Doty, M Eftekhari - Theoretical Computer Science, 2021 - Elsevier
The population protocol model describes a network of n anonymous agents who cannot
control with whom they interact. The agents collectively solve a computational problem …

[HTML][HTML] Time-space trade-offs in population protocols for the majority problem

P Berenbrink, R Elsässer, T Friedetzky, D Kaaser… - Distributed …, 2021 - Springer
Population protocols are a model for distributed computing that is focused on simplicity and
robustness. A system of n identical agents (finite state machines) performs a global task like …

Recent results in population protocols for exact majority and leader election

R Elsässer, T Radzik - Bulletin of EATCS, 2018 - eatcs.org
Population protocols act in a simple and natural framework to solve fun-damental problems
in networks. Given a population of n anonymous nodes (agents), a scheduler chooses in …

Deterministic population protocols for exact majority and plurality

L Gasieniec, D Hamilton, R Martin… - … on Principles of …, 2017 - drops.dagstuhl.de
In this paper we study space-efficient deterministic population protocols for several variants
of the majority problem including plurality consensus. We focus on space efficient majority …

Simulating population protocols in sub-constant time per interaction

P Berenbrink, D Hammer, D Kaaser, U Meyer… - arXiv preprint arXiv …, 2020 - arxiv.org
We consider the problem of efficiently simulating population protocols. In the population
model, we are given a distributed system of $ n $ agents modeled as identical finite-state …

Optimal proportion computation with population protocols

Y Mocquard, E Anceaume… - 2016 IEEE 15th …, 2016 - ieeexplore.ieee.org
The computational model of population protocols is a formalism that allows the analysis of
properties emerging from simple and pairwise interactions among a very large number of …