Output details
11 - Computer Science and Informatics
Queen's University Belfast
Output title
Sublinear Bounds for Randomized Leader Election
Type
E - Conference contribution
Name of conference/published proceedings
Lecture Notes in Computer Scence : International Conference on Distributed Computing and Networking
Volume number
-
Issue number
-
First page of article
348
ISSN of proceedings
-
Year of publication
2013
URL
-
Number of additional authors
4
Additional information
<12>This paper is winner of the best paper award at ICDCN 2013 and has been invited to a special issue of the prestigious journal Theoretical Computer Science. This is the first paper to show the surprising result that Leader Election can be achieved using a sublinear number of messages (using randomisation and for certain graphs such as complete graphs and good expanders). Leader Election is one of the oldest and most fundamental problems in distributed computing and basis of many advanced algorithms. Therefore, it is difficult but enriching to find any new results in this domain.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - High Performance and Distributed Computing (HPDC)
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
