Time-space trade-offs in population protocols
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has fo...
Main Authors: | Alistarh, Dan, Aspnes, James, Eisenstat, David, Gelashvili, Rati, Rivest, Ronald L |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics (SIAM)
2017
|
Online Access: | http://hdl.handle.net/1721.1/110941 https://orcid.org/0000-0002-6151-1061 https://orcid.org/0000-0002-7105-3690 |
Similar Items
-
On the optimal space complexity of consensus for anonymous processes
by: Gelashvili, Rati
Published: (2021) -
On the complexity of synchronization
by: Gelashvili, Rati
Published: (2017) -
Leader election and renaming with optimal message complexity
by: Gelashvili, Rati
Published: (2014) -
Trade-offs in Robustness to Perturbations of Bacterial Population Controllers *
by: McBride, Cameron David, et al.
Published: (2022) -
A simple model for assessing climate control trade-offs and responding to unanticipated climate outcomes
by: Drake, Henri F, et al.
Published: (2022)