Brief Announcement

DOI10.1145/3212734.3212788zbMath1428.68077arXiv1802.06872OpenAlexW2889078364MaRDI QIDQ5197713

Przemysław Uznański, Adrian Kosowski

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (8)

On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Fault-tolerant simulation of population protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ Unnamed Item ⋮ Composable computation in discrete chemical reaction networks

This page was built for publication: Brief Announcement