scientific article; zbMATH DE number 7204593

DOI10.4230/LIPIcs.ICALP.2017.141zbMath1442.68014arXiv1811.01235MaRDI QIDQ5111475

David Soloveichik, David Doty, Amanda Belleville

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1811.01235

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

population protocolstable computationtime lower bound

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Approximation algorithms (68W25)

Related Items (9)

Simple and fast approximate counting and leader election in populations ⋮ Constant-Space Population Protocols for Uniform Bipartition ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Computing with chemical reaction networks: a tutorial ⋮ Running time analysis of broadcast consensus protocols ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ A survey of size counting in population protocols ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Composable computation in discrete chemical reaction networks

This page was built for publication: