On the Complexity of Universal Leader Election
- Submitting institution
-
Loughborough University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1946
- Type
- D - Journal article
- DOI
-
10.1145/2699440
- Title of journal
- Journal of the ACM
- Article number
- 7
- First page
- 1
- Volume
- 62
- Issue
- 1
- ISSN
- 0004-5411
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2015
- 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
-
4
- Research group(s)
-
-
- Citation count
- 23
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work has impacted the state of the art by proving long suspected but previously unproven lower bounds on time and messages for all (even randomized) Leader Election algorithms and almost matching upper bound algorithms. The conference version was best-paper runner-up at the premier distributed computing conference ACM PODC 2013 and invited directly to the prestigious J.ACM (only the top two are invited).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -