D. Alistarh, J. Aspnes, D. Eisenstat, R. Gelashvili, and R. L. Rivest, Time-space trade-offs in population protocols, Proc. Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.2560-2579, 2017.

D. Alistarh, J. Aspnes, and R. Gelashvili, Space-optimal majority in population protocols, Proc. Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 2221-2239, 2018.

D. Alistarh and R. Gelashvili, Polylogarithmic-time leader election in population protocols, Proc. 42nd International Colloquium on Automata, Languages, and Programming, pp.479-491, 2015.

D. Alistarh and R. Gelashvili, Recent algorithmic advances in population protocols, SIGACT News, vol.49, pp.63-73, 2018.

D. Alistarh, R. Gelashvili, and M. Vojnovic, Fast and exact majority in population protocols, Proc. 2015 ACM Symposium on Principles of Distributed Computing, PODC, pp.47-56, 2015.

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, pp.235-253, 2006.

D. Angluin, J. Aspnes, and D. Eisenstat, Fast computation by population protocols with a leader, Distributed Computing, vol.21, pp.183-199, 2008.

D. Angluin, J. Aspnes, and D. Eisenstat, A simple population protocol for fast robust approximate majority, Distributed Computing, vol.21, pp.87-102, 2008.

Y. Azar, A. Z. Broder, and A. R. Karlin, On-Line Load Balancing, Theor. Comput. Sci, vol.130, pp.90153-90161, 1994.

P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser, P. Kling et al., A population protocol for exact majority with O (log 5/3 n) stabilization time and ?(log n) states, Proc. 32nd International Symposium on Distributed Computing, DISC, vol.10, p.10, 2018.

P. Berenbrink, D. Kaaser, P. Kling, and L. Otterbach, Simple and efficient leader election, Proc. 1st Symposium on Simplicity in Algorithms, SOSA, vol.9, pp.1-9, 2018.

P. Berenbrink, D. Kaaser, and T. Radzik, On counting the population size, Proc. 2019 ACM Symposium on Principles of Distributed Computing, PODC, pp.43-52, 2019.

A. Bilke, C. Cooper, R. Elsässer, and T. Radzik, Population protocols for leader election and exact majority with O (log 2 n) states and O (log 2 n) convergence time, 2017.

M. James, H. Bower, and . Bolouri, Computational Modeling of Genetic and Biochemical Networks, 2001.

R. Ho-lin-chen, D. Cummings, D. Doty, and . Soloveichik, Speed faults in computation by chemical reaction networks, Distributed Computing, vol.30, pp.373-390, 2017.

J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis, P. G. Spirakis et al., On convergence and threshold properties of discrete Lotka-Volterra population protocols, Proc. 42nd International Colloquium on Automata, Languages, and Programming, ICALP. 393-405, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01137486

B. Doerr, Analyzing randomized search heuristics: Tools from probability theory, Theory of Randomized Search Heuristics: Foundations and Recent Developments, pp.1-20, 2011.

D. Doty, Timing in chemical reaction networks, Proc. Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014.

D. Doty and M. Eftekhari, Efficient size estimation and impossibility of termination in uniform dense population protocols, Proc. 2019, 2019.

, ACM Symposium on Principles of Distributed Computing

D. Doty, M. Eftekhari, O. Michail, P. G. Spirakis, and M. Theofilatos, Exact size counting in uniform population protocols in nearly logarithmic time, 2018.

D. Doty and D. Soloveichik, Stable leader election in population protocols requires linear time, Distributed Computing, vol.31, pp.257-271, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01207238

B. Dudek and A. Kosowski, Universal protocols for information dissemination using emergent signals, Proc. 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC. 87-99, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01503359

R. Elsässer and T. Radzik, Recent results in population protocols for exact majority and leader election, Bulletin of the EATCS, vol.126, 2018.

L. Gasieniec and G. Stachowiak, Fast space optimal leader election in population protocols, Proc. Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 2653-2667, 2018.

L. Gasieniec, G. Stachowiak, and P. Uznanski, Almost logarithmic-time space optimal leader election in population protocols, Proc. 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA, pp.93-102, 2019.

S. Goldwasser, R. Ostrovsky, A. Scafuro, and A. Sealfon, Population stability: Regulating size in the presence of an adversary, Proc. 2018 ACM Symposium on Principles of Distributed Computing, PODC, pp.397-406, 2018.

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, Proc. 41st Annual Symposium on Foundations of Computer Science, FOCS, pp.565-574, 2000.

A. Kosowski and P. Uznanski, Population protocols made easy, 2018.

Y. Sudo and T. Masuzawa, Leader election requires logarithmic time in population protocols, 2019.

Y. Sudo, F. Ooshita, T. Izumi, H. Kakugawa, and T. Masuzawa, Logarithmic expected-time leader election in population protocol model, Proc. 2019 ACM Symposium on Principles of Distributed Computing, PODC, pp.60-62, 2019.