Time-space trade-offs in population protocols, Proc. Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.2560-2579, 2017. ,
Space-optimal majority in population protocols, Proc. Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 2221-2239, 2018. ,
Polylogarithmic-time leader election in population protocols, Proc. 42nd International Colloquium on Automata, Languages, and Programming, pp.479-491, 2015. ,
Recent algorithmic advances in population protocols, SIGACT News, vol.49, pp.63-73, 2018. ,
Fast and exact majority in population protocols, Proc. 2015 ACM Symposium on Principles of Distributed Computing, PODC, pp.47-56, 2015. ,
Computation in networks of passively mobile finite-state sensors. Distributed Computing, vol.18, pp.235-253, 2006. ,
Fast computation by population protocols with a leader, Distributed Computing, vol.21, pp.183-199, 2008. ,
A simple population protocol for fast robust approximate majority, Distributed Computing, vol.21, pp.87-102, 2008. ,
On-Line Load Balancing, Theor. Comput. Sci, vol.130, pp.90153-90161, 1994. ,
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. ,
Simple and efficient leader election, Proc. 1st Symposium on Simplicity in Algorithms, SOSA, vol.9, pp.1-9, 2018. ,
On counting the population size, Proc. 2019 ACM Symposium on Principles of Distributed Computing, PODC, pp.43-52, 2019. ,
Population protocols for leader election and exact majority with O (log 2 n) states and O (log 2 n) convergence time, 2017. ,
Computational Modeling of Genetic and Biochemical Networks, 2001. ,
Speed faults in computation by chemical reaction networks, Distributed Computing, vol.30, pp.373-390, 2017. ,
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
Analyzing randomized search heuristics: Tools from probability theory, Theory of Randomized Search Heuristics: Foundations and Recent Developments, pp.1-20, 2011. ,
Timing in chemical reaction networks, Proc. Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014. ,
Efficient size estimation and impossibility of termination in uniform dense population protocols, Proc. 2019, 2019. ,
, ACM Symposium on Principles of Distributed Computing
Exact size counting in uniform population protocols in nearly logarithmic time, 2018. ,
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
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
Recent results in population protocols for exact majority and leader election, Bulletin of the EATCS, vol.126, 2018. ,
Fast space optimal leader election in population protocols, Proc. Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 2653-2667, 2018. ,
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. ,
Population stability: Regulating size in the presence of an adversary, Proc. 2018 ACM Symposium on Principles of Distributed Computing, PODC, pp.397-406, 2018. ,
Randomized rumor spreading, Proc. 41st Annual Symposium on Foundations of Computer Science, FOCS, pp.565-574, 2000. ,
Population protocols made easy, 2018. ,
Leader election requires logarithmic time in population protocols, 2019. ,
Logarithmic expected-time leader election in population protocol model, Proc. 2019 ACM Symposium on Principles of Distributed Computing, PODC, pp.60-62, 2019. ,