{"id":"https://openalex.org/W4281990278","doi":"https://doi.org/10.1145/3519270.3538435","title":"Near-Optimal Leader Election in Population Protocols on Graphs","display_name":"Near-Optimal Leader Election in Population Protocols on Graphs","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4281990278","doi":"https://doi.org/10.1145/3519270.3538435"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538435","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538435","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538435","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538435","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091604054","display_name":"Joel Rybicki","orcid":"https://orcid.org/0000-0002-6432-6646"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Joel Rybicki","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045715979","display_name":"Sasha Voitovych","orcid":"https://orcid.org/0000-0003-1840-476X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sasha Voitovych","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6672,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69233871,"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":"246","last_page":"256"},"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.9994999766349792,"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.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9918000102043152,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7226797342300415},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6491942405700684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6346202492713928},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.583415687084198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5277308225631714},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5213019251823425},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4913841784000397},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.45736178755760193},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43396225571632385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40238088369369507},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3689979314804077},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.353232741355896},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32230138778686523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3043057322502136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21333089470863342},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07619515061378479}],"concepts":[{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.7226797342300415},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6491942405700684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6346202492713928},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.583415687084198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5277308225631714},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5213019251823425},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4913841784000397},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.45736178755760193},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43396225571632385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40238088369369507},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3689979314804077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.353232741355896},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32230138778686523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3043057322502136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21333089470863342},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07619515061378479},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3519270.3538435","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538435","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538435","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pub.research-explorer.ista.ac.at:11844","is_oa":true,"landing_page_url":"https://research-explorer.ista.ac.at/record/11844","pdf_url":"https://research-explorer.ista.ac.at/download/11844/11854","source":{"id":"https://openalex.org/S7407055285","display_name":"Institute of Science and Technology Austria","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>","raw_type":"http://purl.org/coar/resource_type/c_5794"},{"id":"pmh:oai:dspace.mit.edu:1721.1/162256","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/162256","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Springer Berlin Heidelberg","raw_type":"Article"},{"id":"pmh:oai:pub.research-explorer.ista.ac.at:19969","is_oa":true,"landing_page_url":"https://research-explorer.ista.ac.at/record/19969","pdf_url":null,"source":{"id":"https://openalex.org/S7407055285","display_name":"Institute of Science and Technology Austria","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. <i>Distributed Computing</i>. 2025;38:207-245. doi:<a href=\"https://doi.org/10.1007/s00446-025-00487-7\">10.1007/s00446-025-00487-7</a>","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3519270.3538435","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538435","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538435","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3385179401","display_name":"Elastic Coordination for Scalable Machine Learning","funder_award_id":"805223","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4927157431","display_name":null,"funder_award_id":"805223","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281990278.pdf","grobid_xml":"https://content.openalex.org/works/W4281990278.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W127957994","https://openalex.org/W1493079923","https://openalex.org/W1654156573","https://openalex.org/W1789316180","https://openalex.org/W2006072889","https://openalex.org/W2009356484","https://openalex.org/W2038562061","https://openalex.org/W2042437235","https://openalex.org/W2059959102","https://openalex.org/W2082781959","https://openalex.org/W2084768526","https://openalex.org/W2149345630","https://openalex.org/W2156184725","https://openalex.org/W2157004711","https://openalex.org/W2275408670","https://openalex.org/W2399651233","https://openalex.org/W2405987069","https://openalex.org/W2495546859","https://openalex.org/W2514142910","https://openalex.org/W2609887493","https://openalex.org/W2706788079","https://openalex.org/W2743261842","https://openalex.org/W2898165178","https://openalex.org/W2950605817","https://openalex.org/W2963679548","https://openalex.org/W2963844133","https://openalex.org/W2964080237","https://openalex.org/W2964266424","https://openalex.org/W3008801280","https://openalex.org/W3011831250","https://openalex.org/W3016416987","https://openalex.org/W3022212462","https://openalex.org/W3046731497","https://openalex.org/W3104722849","https://openalex.org/W3106250499","https://openalex.org/W3108725138","https://openalex.org/W3158164934","https://openalex.org/W4205300528","https://openalex.org/W4252911490","https://openalex.org/W4281990278","https://openalex.org/W4293507953","https://openalex.org/W4399772000","https://openalex.org/W6966440248"],"related_works":["https://openalex.org/W2619625312","https://openalex.org/W2789179878","https://openalex.org/W2601062540","https://openalex.org/W3097369619","https://openalex.org/W3209455166","https://openalex.org/W4302907686","https://openalex.org/W1973013791","https://openalex.org/W2952144494","https://openalex.org/W4287691960","https://openalex.org/W3046990805"],"abstract_inverted_index":{"In":[0],"the":[1,26,32,59,82,94],"stochastic":[2],"population":[3],"protocol":[4],"model,":[5],"we":[6],"are":[7],"given":[8],"a":[9,20,64],"connected":[10,34],"graph":[11,27],"with":[12],"n":[13],"nodes,":[14],"and":[15,31,58,76],"in":[16,42,49,54,66,106],"every":[17],"time":[18],"step,":[19],"scheduler":[21],"samples":[22],"an":[23,55],"edge":[24,37],"of":[25,89,96],"uniformly":[28],"at":[29],"random":[30],"nodes":[33,52],"by":[35],"this":[36,43,78,97],"interact.":[38],"A":[39],"fundamental":[40],"task":[41],"model":[44],"is":[45,61,72],"stable":[46],"leader":[47,75,84],"election,":[48],"which":[50,67],"all":[51],"start":[53],"identical":[56],"state":[57],"aim":[60],"to":[62],"reach":[63],"configuration":[65],"(1)":[68],"exactly":[69],"one":[70],"node":[71,79],"elected":[73],"as":[74,81],"(2)":[77],"remains":[80],"unique":[83],"no":[85],"matter":[86],"what":[87],"sequence":[88],"interactions":[90],"follows.":[91],"On":[92],"cliques,":[93],"complexity":[95],"problem":[98],"has":[99],"recently":[100],"been":[101],"settled:":[102],"time-optimal":[103],"protocols":[104,118],"stabilize":[105],"\u0398(n":[107],"log":[108,114],"n)":[109,115],"expected":[110,125],"steps":[111],"using":[112],"\u0398(log":[113],"states,":[116],"whereas":[117],"that":[119],"use":[120],"O(1)":[121],"states":[122],"require":[123],"\u0398(n2)":[124],"steps.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}