Determining majority in networks with local interactions and very small local memory
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12050
- Type
- D - Journal article
- DOI
-
10.1007/s00446-016-0277-8
- Title of journal
- Distributed Computing
- Article number
- -
- First page
- 1
- Volume
- 30
- Issue
- 1
- ISSN
- 0178-2770
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper appeared in ICALP'14. It presented the "ambassador protocol", which is used in more complicated protocols that it facilitated, for example in "Fast and Exact Majority in Population Protocols" (PODC'15) and "Space-Optimal Majority in Population Protocols" (SODA'18). The work has also had interdisciplinary influence in the study of chemical reaction networks. For example, it informed the experiments in "Synthesizing and tuning stochastic chemical reaction networks with specified behaviours" (J. Royal Society Interface 2018) and informed the settings considered in "Chemical reaction network designs for asynchronous logic circuits" (Natural Computing 2018).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -