Explicit and tight bounds of the convergence time of average-based population protocols

DOI10.1007/978-3-030-24922-9_29OpenAlexW2960301807MaRDI QIDQ2303306

Bruno Sericola, Emmanuelle Anceaume, Yves Mocquard

Publication date: 3 March 2020

Full work available at URL: https://hal-cnrs.archives-ouvertes.fr/hal-02380422/file/main.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Related Items (1)

A survey of size counting in population protocols

This page was built for publication: Explicit and tight bounds of the convergence time of average-based population protocols