{"id":"https://openalex.org/W2804651489","doi":"https://doi.org/10.1145/3288599.3288601","title":"Distributed symmetry-breaking with improved vertex-averaged complexity","display_name":"Distributed symmetry-breaking with improved vertex-averaged complexity","publication_year":2019,"publication_date":"2019-01-04","ids":{"openalex":"https://openalex.org/W2804651489","doi":"https://doi.org/10.1145/3288599.3288601","mag":"2804651489"},"language":"en","primary_location":{"id":"doi:10.1145/3288599.3288601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3288599.3288601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1805.09861","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057471294","display_name":"Leonid Barenboim","orcid":"https://orcid.org/0000-0002-9021-3549"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Leonid Barenboim","raw_affiliation_strings":["Open University of Israel, Ra'anana, Israel","Open University of Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]},{"raw_affiliation_string":"Open University of Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060294762","display_name":"Yaniv Tzur","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yaniv Tzur","raw_affiliation_strings":["Open University of Israel, Ra'anana, Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057471294"],"corresponding_institution_ids":["https://openalex.org/I164950643"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01580385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/vertex","display_name":"Vertex (graph theory)","score":0.7361826300621033},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5510776042938232},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5465779304504395},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5189476013183594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5169350504875183},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4932841658592224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4928267300128937},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47446686029434204},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42100125551223755},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4179624617099762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4085933566093445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3900448977947235},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3081628084182739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30213385820388794},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17973294854164124}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7361826300621033},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5510776042938232},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5465779304504395},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5189476013183594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5169350504875183},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4932841658592224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4928267300128937},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47446686029434204},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42100125551223755},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4179624617099762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4085933566093445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3900448977947235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3081628084182739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30213385820388794},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17973294854164124}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3288599.3288601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3288599.3288601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1805.09861","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.09861","pdf_url":"https://arxiv.org/pdf/1805.09861","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2804651489","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1805.09861v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1805.09861","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1805.09861","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1805.09861","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.09861","pdf_url":"https://arxiv.org/pdf/1805.09861","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G2332339680","display_name":null,"funder_award_id":"724/15","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2804651489.pdf","grobid_xml":"https://content.openalex.org/works/W2804651489.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1964932074","https://openalex.org/W1975092363","https://openalex.org/W1987125980","https://openalex.org/W1992776880","https://openalex.org/W1996066664","https://openalex.org/W1998643836","https://openalex.org/W2006040238","https://openalex.org/W2017345786","https://openalex.org/W2022143201","https://openalex.org/W2022155283","https://openalex.org/W2034499376","https://openalex.org/W2054910423","https://openalex.org/W2065826935","https://openalex.org/W2073975876","https://openalex.org/W2074687256","https://openalex.org/W2100061495","https://openalex.org/W2112009244","https://openalex.org/W2118288908","https://openalex.org/W2169102947","https://openalex.org/W2296210868","https://openalex.org/W2554518674","https://openalex.org/W2607170537","https://openalex.org/W2621823477","https://openalex.org/W2963238998","https://openalex.org/W2963830589"],"related_works":["https://openalex.org/W2809329643","https://openalex.org/W2962844160","https://openalex.org/W3130519349","https://openalex.org/W3022296711","https://openalex.org/W1886232660","https://openalex.org/W3186734588","https://openalex.org/W3099044340","https://openalex.org/W2950546819","https://openalex.org/W175379075","https://openalex.org/W3022408285","https://openalex.org/W2971407628","https://openalex.org/W2951437563","https://openalex.org/W2395489635","https://openalex.org/W3042194019","https://openalex.org/W2964104106","https://openalex.org/W1639030016","https://openalex.org/W2074687256","https://openalex.org/W2242793104","https://openalex.org/W2802632688","https://openalex.org/W1538365848"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,21,32,37,65,69,84,93,105,112,115,147,157,161,167,188,195,201,214,226],"distributed":[3],"message-passing":[4],"model":[5,30],"in":[6,28,56,75,100,121,143,219],"which":[7,35,76,101],"a":[8,14,44,53,137],"communication":[9],"network":[10],"is":[11,26,31,36,52,118,141,160,205],"represented":[12],"by":[13,43,152],"graph":[15],"G":[16],"=":[17],"(V,":[18],"E).":[19],"Usually,":[20],"measure":[22,140],"of":[23,40,68,108,164,169,193,217],"complexity":[24,149,183,204,216],"that":[25,174],"considered":[27],"this":[29,51,155],"worst-case":[33,162,185,196,227],"complexity,":[34],"largest":[38],"number":[39,107,168],"rounds":[41,89,109,165],"performed":[42],"vertex":[45],"\u03bd":[46],"\u2208":[47],"V.":[48],"While":[49],"often":[50],"reasonable":[54],"measure,":[55,156],"some":[57],"occasions":[58],"it":[59],"does":[60],"not":[61],"express":[62],"sufficiently":[63],"well":[64],"actual":[66],"performance":[67],"algorithm.":[70],"For":[71],"example,":[72],"an":[73,98,177],"execution":[74,99,117,129],"one":[77],"processor":[78],"performs":[79],"r":[80],"rounds,":[81],"and":[82,133,197],"all":[83,102],"rest":[85],"perform":[86,104],"significantly":[87,180],"less":[88,119],"than":[90,184,225],"r,":[91],"has":[92],"same":[94,106],"running":[95,158],"time":[96,159],"as":[97,125],"processors":[103],"r.":[110],"On":[111,187],"other":[113,189],"hand,":[114,190],"latter":[116],"efficient":[120],"several":[122],"respects,":[123],"such":[124],"energy":[126],"efficiency,":[127,130],"task":[128],"local-neighborhood":[131],"efficiency":[132],"simulation":[134],"efficiency.":[135],"Consequently,":[136],"more":[138],"appropriate":[139],"required":[142],"these":[144],"cases.":[145],"Recently,":[146],"vertex-averaged":[148,182,198,215],"was":[150],"proposed":[151],"[13].":[153,209],"In":[154],"average":[163],"over":[166],"vertices.":[170],"Feuilloley":[171],"[13]":[172],"showed":[173],"leader-election":[175],"admits":[176],"algorithm":[178],"with":[179],"better":[181,224],"complexity.":[186,228],"for":[191],"O(1)-coloring":[192],"rings,":[194],"complexities":[199],"are":[200],"same.":[202],"This":[203],"\u0398":[206],"(log*":[207],"n)":[208],"It":[210],"remained":[211],"open":[212],"whether":[213],"symmetry-breaking":[218],"general":[220],"graphs":[221],"can":[222],"be":[223]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}