{"id":"https://openalex.org/W2011668511","doi":"https://doi.org/10.1145/2484239.2484274","title":"On the complexity of universal leader election","display_name":"On the complexity of universal leader election","publication_year":2013,"publication_date":"2013-07-16","ids":{"openalex":"https://openalex.org/W2011668511","doi":"https://doi.org/10.1145/2484239.2484274","mag":"2011668511"},"language":"en","primary_location":{"id":"doi:10.1145/2484239.2484274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pureadmin.qub.ac.uk/ws/files/17451767/Pure_Jacm_Version.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033442948","display_name":"Shay Kutten","orcid":"https://orcid.org/0000-0003-2062-6855"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shay Kutten","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["The Weizmann Institute, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"The Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103150417","display_name":"Peter Robinson","orcid":"https://orcid.org/0000-0002-7442-7002"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004522545","display_name":"Amitabh Trehan","orcid":"https://orcid.org/0000-0002-2998-0933"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amitabh Trehan","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5033442948"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":2.262,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88912074,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.8049466013908386},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.7493156790733337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6415515542030334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6156975030899048},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5900391340255737},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5019586086273193},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4908800721168518},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4749488830566406},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4609634578227997},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4467256963253021},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4133145809173584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3338244557380676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3304697275161743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3079509735107422},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.20129740238189697}],"concepts":[{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.8049466013908386},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7493156790733337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6415515542030334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6156975030899048},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5900391340255737},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5019586086273193},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4908800721168518},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4749488830566406},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4609634578227997},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4467256963253021},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4133145809173584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3338244557380676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3304697275161743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3079509735107422},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.20129740238189697},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2484239.2484274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/3e022c01-3fba-41be-b286-2dfbb05f7515","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/3e022c01-3fba-41be-b286-2dfbb05f7515","pdf_url":"https://pureadmin.qub.ac.uk/ws/files/17451767/Pure_Jacm_Version.pdf","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kutten , S , Pandurangan , G , Peleg , D , Robinson , P & Trehan , A 2015 , ' On the Complexity of Universal Leader Election ' , Journal of the ACM , vol. 62 , no. 1 , 7 . https://doi.org/10.1145/2699440","raw_type":"article"},{"id":"pmh:oai:durham-repository.worktribe.com:1140291","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1140291","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},{"id":"pmh:oai:durham-repository.worktribe.com:1255104","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1255104","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/4b819b8f-0693-442a-8e66-cdc1ddd1ce87","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/4b819b8f-0693-442a-8e66-cdc1ddd1ce87","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kutten , S , Pandurangan , G , Peleg , D , Robinson , P & Trehan , A 2013 , On the Complexity of Universal Leader Election . in Proceedings of the 2013 ACM symposium on principles of distributed computing . vol. null , Association for Computing Machinery , pp. 100-109 . https://doi.org/10.1145/2484239.2484274","raw_type":"bookPart"}],"best_oa_location":{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/3e022c01-3fba-41be-b286-2dfbb05f7515","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/3e022c01-3fba-41be-b286-2dfbb05f7515","pdf_url":"https://pureadmin.qub.ac.uk/ws/files/17451767/Pure_Jacm_Version.pdf","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kutten , S , Pandurangan , G , Peleg , D , Robinson , P & Trehan , A 2015 , ' On the Complexity of Universal Leader Election ' , Journal of the ACM , vol. 62 , no. 1 , 7 . https://doi.org/10.1145/2699440","raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2011668511.pdf","grobid_xml":"https://content.openalex.org/works/W2011668511.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W204012175","https://openalex.org/W648150138","https://openalex.org/W1498909462","https://openalex.org/W1538106700","https://openalex.org/W1568961751","https://openalex.org/W1894812608","https://openalex.org/W1969080501","https://openalex.org/W1974895073","https://openalex.org/W1976485065","https://openalex.org/W1976986662","https://openalex.org/W2025827262","https://openalex.org/W2027018686","https://openalex.org/W2053788000","https://openalex.org/W2091422818","https://openalex.org/W2092938419","https://openalex.org/W2093606353","https://openalex.org/W2105666891","https://openalex.org/W2125572812","https://openalex.org/W2136604606","https://openalex.org/W2295428206","https://openalex.org/W2568406555","https://openalex.org/W2568970963","https://openalex.org/W2611515161","https://openalex.org/W2766624018","https://openalex.org/W4231916799","https://openalex.org/W4251986490","https://openalex.org/W4301005547"],"related_works":["https://openalex.org/W3097369619","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W2982699376","https://openalex.org/W2967413145","https://openalex.org/W4288264556","https://openalex.org/W2293019313","https://openalex.org/W2011668511","https://openalex.org/W2899261484","https://openalex.org/W2069689700"],"abstract_inverted_index":{"Electing":[0],"a":[1,4,107],"leader":[2,16,37],"is":[3,20,64,76,97,105],"fundamental":[5],"task":[6],"in":[7,39,69,102,113],"distributed":[8,41],"computing.":[9],"In":[10],"its":[11],"implicit":[12,36],"version,":[13],"only":[14],"the":[15,21,29,44,65,70,77,98,103,111,117,124,143],"must":[17],"know":[18],"who":[19],"elected":[22],"leader.":[23],"This":[24],"paper":[25],"focuses":[26],"on":[27,110],"studying":[28],"message":[30],"and":[31,72,162,165],"time":[32,74],"complexity":[33,47],"of":[34,60,67,100,126,146],"randomized":[35,54,85],"election":[38],"synchronous":[40],"networks.":[42],"Surprisingly,":[43],"most":[45],"\"obvious\"":[46,57],"bounds":[48,59,119,132],"have":[49,133],"not":[50,106,134,158,168],"been":[51,135],"proven":[52],"for":[53,84,138,142],"algorithms.":[55,88],"The":[56],"lower":[58,108,131],"\u03a9(m)":[61],"messages":[62,112],"(m":[63],"number":[66,99],"edges":[68],"network)":[71,104],"\u03a9(D)":[73],"(D":[75],"network":[78],"diameter)":[79],"are":[80],"non-trivial":[81],"to":[82],"show":[83,92],"(Monte":[86],"Carlo)":[87],"(Recent":[89],"results":[90],"that":[91,93,154,163],"even":[94,137],"\u03a9(n)":[95],"(n":[96],"nodes":[101,156],"bound":[109],"complete":[114],"networks,":[115],"make":[116],"above":[118],"somewhat":[120],"less":[121],"obvious).":[122],"To":[123],"best":[125],"our":[127],"knowledge,":[128],"these":[129],"basic":[130],"established":[136],"deterministic":[139],"algorithms":[140],"(except":[141],"limited":[144],"case":[145],"comparison":[147],"algorithms,":[148],"where":[149],"it":[150],"was":[151],"also":[152],"required":[153],"some":[155],"may":[157],"wake":[159],"up":[160],"spontaneously,":[161],"D":[164],"n":[166],"were":[167],"known).":[169]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}