Brief announcement: fast approximate counting and leader election in populations

DOI10.1007/978-3-030-01325-7_7OpenAlexW2899023231MaRDI QIDQ1713888

Michail Theofilatos, Paul G. Spirakis, Othon Michail

Publication date: 30 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_7

zbMATH Keywords

countingleader electionepidemicapproximate countingpopulation protocolpolylogarithmic time protocol

Mathematics Subject Classification ID

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

Related Items (2)

Simple and fast approximate counting and leader election in populations ⋮ Leader Election Requires Logarithmic Time in Population Protocols

This page was built for publication: Brief announcement: fast approximate counting and leader election in populations