Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 15785
- Type
- D - Journal article
- DOI
-
10.1145/3424659
- Title of journal
- Journal of the ACM
- Article number
- 2
- First page
- 1
- Volume
- 68
- Issue
- 1
- ISSN
- 0004-5411
- Open access status
- Compliant
- Month of publication
- November
- Year of publication
- 2020
- 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
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of the paper appeared as "Fast Space Optimal Leader Election in Population Protocols" at SODA'18. It studies the fundamental problem of leader election in population protocols, a model of Angluin et al (Distributed Computing 2006) that won the Dijkstra Prize in Distributed Computing 2020. The results were recognised as a breakthrough in two recent surveys on population protocols by Alistarh and Gelashvili (ACM SIGACT News 2018) and Elsaesser and Radzik (EATCS Bulletin 2018).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -