{"acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926,\r\nand  IIS-1447786,  the  Department  of  Energy  under  grant\r\nER26116/DE-SC0008923,  and the  Oracle  and Intel  corporations.\r\nThe authors would like to thank Prof.  Nir Shavit for ad-\r\nvice and encouragement during this work,  and the anonymous reviewers for their very useful suggestions.","article_processing_charge":"No","year":"2015","type":"conference","oa_version":"None","volume":"2015-July","month":"07","publisher":"ACM","publist_id":"6875","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"}],"citation":{"ama":"Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:<a href=\"https://doi.org/10.1145/2767386.2767420\">10.1145/2767386.2767420</a>","chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. <a href=\"https://doi.org/10.1145/2767386.2767420\">https://doi.org/10.1145/2767386.2767420</a>.","ieee":"D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.","mla":"Alistarh, Dan-Adrian, et al. <i>How to Elect a Leader Faster than a Tournament</i>. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:<a href=\"https://doi.org/10.1145/2767386.2767420\">10.1145/2767386.2767420</a>.","apa":"Alistarh, D.-A., Gelashvili, R., &#38; Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. <a href=\"https://doi.org/10.1145/2767386.2767420\">https://doi.org/10.1145/2767386.2767420</a>","ista":"Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.","short":"D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374."},"title":"How to elect a leader faster than a tournament","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"783","status":"public","date_updated":"2023-02-23T13:18:55Z","date_created":"2018-12-11T11:48:28Z","main_file_link":[{"url":"https://arxiv.org/abs/1411.1001","open_access":"1"}],"doi":"10.1145/2767386.2767420","abstract":[{"lang":"eng","text":"The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity."}],"language":[{"iso":"eng"}],"oa":1,"extern":"1","conference":{"name":"PODC: Principles of Distributed Computing"},"page":"365 - 374","date_published":"2015-07-21T00:00:00Z","publication_status":"published","day":"21"}