{"id":"https://openalex.org/W2809329643","doi":"https://doi.org/10.1145/3210377.3210660","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2809329643","doi":"https://doi.org/10.1145/3210377.3210660","mag":"2809329643"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Ra'anana, 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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10125323,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"226"},"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.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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.9976000189781189,"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.7248750329017639},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6039619445800781},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.592522919178009},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.575387179851532},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.5239272713661194},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5091091990470886},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49828386306762695},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.46913573145866394},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.43051719665527344},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4177606403827667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41711705923080444},{"id":"https://openalex.org/keywords/rest","display_name":"Rest (music)","score":0.41045117378234863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39379724860191345},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3766128420829773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3597060739994049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35471311211586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.322736918926239},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21110805869102478}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7248750329017639},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6039619445800781},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.592522919178009},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.575387179851532},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5239272713661194},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5091091990470886},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49828386306762695},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.46913573145866394},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.43051719665527344},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4177606403827667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41711705923080444},{"id":"https://openalex.org/C77265313","wikidata":"https://www.wikidata.org/wiki/Q879844","display_name":"Rest (music)","level":2,"score":0.41045117378234863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39379724860191345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3766128420829773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3597060739994049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35471311211586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.322736918926239},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21110805869102478},{"id":"https://openalex.org/C164705383","wikidata":"https://www.wikidata.org/wiki/Q10379","display_name":"Cardiology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1964932074","https://openalex.org/W1987125980","https://openalex.org/W1996066664","https://openalex.org/W1998643836","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/W2100061495","https://openalex.org/W2112009244","https://openalex.org/W2118288908","https://openalex.org/W2169102947","https://openalex.org/W2607170537","https://openalex.org/W2767995863","https://openalex.org/W2963830589"],"related_works":["https://openalex.org/W2592840164","https://openalex.org/W1709331905","https://openalex.org/W4297260888","https://openalex.org/W3012609114","https://openalex.org/W2003327526","https://openalex.org/W1838573249","https://openalex.org/W2048012077","https://openalex.org/W4226218108","https://openalex.org/W2378001377","https://openalex.org/W3045797592"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,29,34,62,66,81,91,103,111,114,146,156,160,166,187,194,200,213,225,259,282,286,292,300],"distributed":[3],"message-passing":[4],"model":[5,27],"in":[6,25,53,72,98,120,142,218],"which":[7,32,73,99],"a":[8,14,41,49,136,284],"communication":[9],"network":[10],"is":[11,23,28,33,48,117,140,159,204,285],"represented":[12],"by":[13,40,151],"graph":[15,247],"G=(V,E)":[16],"Usually,":[17],"measure":[19,139],"of":[20,37,65,106,163,168,192,216,251,278,289],"complexity":[21,148,182,203,215,239,257,277],"that":[22,173,291],"considered":[24],"this":[26,47,154,229,302],"worst-case":[30,161,184,195,226],"complexity,":[31],"largest":[35],"number":[36,105,167,288],"rounds":[38,86,107,164,306],"performed":[39],"vertex":[42],"v":[43],"\u03b5":[44],"V.":[45],"Often":[46],"reasonable":[50],"measure,":[51,155],"but":[52],"some":[54],"occasions":[55],"it":[56],"does":[57],"not":[58],"express":[59],"sufficiently":[60],"well":[61,244],"actual":[63],"performance":[64],"algorithm.":[67],"For":[68,264],"example,":[69,265],"an":[70,96,176,271],"execution":[71,97,116,128],"one":[74],"processor":[75],"performs":[76],"r":[77,88,108],"rounds,":[78],"and":[79,132,196],"all":[80,100],"rest":[82],"perform":[83,102],"significantly":[84,179,236,254],"less":[85,118],"than":[87,183,224,258],",":[89],"has":[90],"same":[92,104],"running":[93,157],"time":[94,158],"as":[95,124,243,245],"processors":[101],".":[109],"On":[110,186],"other":[112,188],"hand,":[113,189],"latter":[115],"efficient":[119],"several":[121],"respects,":[122],"such":[123],"energy":[125],"efficiency,":[126,129],"task":[127],"local-neighborhood":[130],"efficiency":[131],"simulation":[133],"efficiency.":[134],"Consequently,":[135],"more":[137],"appropriate":[138],"required":[141],"these":[143],"cases.":[144],"Recently,":[145],"vertex-averaged":[147,181,197,214,238,256,276],"was":[149],"proposed":[150],"\\citeFeuilloley2017.":[152],"In":[153,228,299],"average":[162],"over":[165],"vertices.":[169],"Feuilloley":[170],"\\citeFeuilloley2017":[171],"showed":[172],"leader-election":[174],"admits":[175],"algorithm":[177,274],"with":[178,235,275],"better":[180,223,255],"complexity.":[185,227,263],"for":[190,240,266],"$O(1)$-coloring":[191],"rings,":[193],"complexities":[198],"are":[199],"same.":[201],"This":[202],"O":[205],"(log*":[206],"n)":[207,305],"[9].":[208],"It":[209],"remained":[210],"open":[211],"whether":[212],"symmetry-breaking":[217,233],"general":[219,241,267],"graphs":[220],"can":[221,295],"be":[222,296],"paper":[230],"we":[231,269],"devise":[232,270],"algorithms":[234,250],"improved":[237],"graphs,":[242,268],"specific":[246],"families.":[248],"Some":[249],"ours":[252],"have":[253],"best-possible":[260],"worst":[261],"case":[262],"O(a^2":[272],")-vertex-coloring":[273],"O(loglog":[279],"n),":[280],"where":[281],"arboricity":[283],"minimum":[287],"forests":[290],"graph's":[293],"edges":[294],"partitioned":[297],"into.":[298],"worst-case,":[301],"requires":[303],"\u03a9(log":[304],"\\citeBarenboim2008.":[307]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-06-29T00:00:00"}