{"id":"https://openalex.org/W2065826935","doi":"https://doi.org/10.1145/2027216.2027221","title":"Deterministic Distributed Vertex Coloring in Polylogarithmic Time","display_name":"Deterministic Distributed Vertex Coloring in Polylogarithmic Time","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2065826935","doi":"https://doi.org/10.1145/2027216.2027221","mag":"2065826935"},"language":"en","primary_location":{"id":"doi:10.1145/2027216.2027221","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2027216.2027221","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Leonid Barenboim","raw_affiliation_strings":["Ben-Gurion University of the Negev","Ben Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev","Ben Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":3.2626,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.91958272,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"58","issue":"5","first_page":"1","last_page":"25"},"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/T10237","display_name":"Cryptography and Data Security","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.994700014591217,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7012189626693726},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.6785861849784851},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6686833500862122},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6664465069770813},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5827614665031433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5371547341346741},{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.5188761353492737},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4327976703643799},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40632978081703186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3785499632358551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3547635078430176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3515021502971649},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.13837102055549622}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7012189626693726},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6785861849784851},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6686833500862122},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6664465069770813},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5827614665031433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5371547341346741},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.5188761353492737},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4327976703643799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40632978081703186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3785499632358551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3547635078430176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3515021502971649},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.13837102055549622}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2027216.2027221","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2027216.2027221","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1023322991","display_name":null,"funder_award_id":"20008390","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G2179199110","display_name":null,"funder_award_id":"483/06","funder_id":"https://openalex.org/F4320322248","funder_display_name":"Israel Academy of Sciences and Humanities"}],"funders":[{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322248","display_name":"Israel Academy of Sciences and Humanities","ror":"https://ror.org/03c6c9520"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W60957894","https://openalex.org/W1964089073","https://openalex.org/W1987125980","https://openalex.org/W1996066664","https://openalex.org/W1998544343","https://openalex.org/W1998643836","https://openalex.org/W2009827511","https://openalex.org/W2033177550","https://openalex.org/W2034499376","https://openalex.org/W2054910423","https://openalex.org/W2065967498","https://openalex.org/W2067661972","https://openalex.org/W2079535727","https://openalex.org/W2100061495","https://openalex.org/W2109368894","https://openalex.org/W2112009244","https://openalex.org/W2119761906","https://openalex.org/W2157459553","https://openalex.org/W2157562188","https://openalex.org/W2169102947","https://openalex.org/W4239362124","https://openalex.org/W6602566282"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W4318350839","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W4287691960","https://openalex.org/W2962965324","https://openalex.org/W2963181990","https://openalex.org/W2748289508","https://openalex.org/W2007715402","https://openalex.org/W2913663107"],"abstract_inverted_index":{"Consider":[0],"an":[1,262,277,292,300,314,343,351],"n":[2,130,175,259,289,310,364],"-vertex":[3],"graph":[4,335],"G":[5,39,63],"=":[6,270],"(":[7,123,151,252,254,267,279,302,307,345],"V":[8,24],",":[9,16,339],"E":[10],")":[11,131,154,269,311],"of":[12,80,86,88,202,206,247,336],"maximum":[13],"degree":[14],"\u0394":[15,65,72,124,152,191,233,255,257,268,280,287,303],"and":[17,226,238,299],"suppose":[18],"that":[19,45,145,231],"each":[20],"vertex":[21,55],"v":[22],"\u2208":[23],"hosts":[25],"a":[26,122,161,228,334,338,346,362],"processor.":[27],"The":[28,41],"processors":[29],"are":[30,105],"allowed":[31],"to":[32,61,94],"communicate":[33],"only":[34],"with":[35,64,133,187],"their":[36],"neighbors":[37],"in":[38,49,160,194,213,223,240,284,305,324,358],".":[40],"communication":[42,81,89],"is":[43,60,171,250],"synchronous,":[44],"is,":[46],"it":[47],"proceeds":[48],"discrete":[50],"rounds.":[51],"In":[52,177,216,331],"the":[53,58,137,140,178,207,224,244],"distributed":[54],"coloring":[56],"problem,":[57],"objective":[59],"color":[62,186],"+":[66,73,125],"1,":[67,74],"or":[68],"slightly":[69],"more":[70,108,327],"than":[71,109,190,329],"colors":[75,193],"using":[76],"as":[77,82,95],"few":[78],"rounds":[79,87],"possible.":[83],"(The":[84],"number":[85],"will":[90],"be":[91],"henceforth":[92],"referred":[93],"running":[96,169,245],"time":[97,148,170,246,359],".)":[98],"Efficient":[99],"randomized":[100],"algorithms":[101,120],"for":[102,107,261,291,313,333,350],"this":[103,200,214,217,221],"problem":[104],"known":[106,142],"twenty":[110],"years":[111],"[Alon":[112],"et":[113],"al.":[114],"1986;":[115],"Luby":[116],"1986].":[117],"Specifically,":[118,243],"these":[119],"produce":[121,276],"1)-coloring":[126],"within":[127],"O":[128,150,172,251,278,285,301,306,344,360],"(log":[129,173,286,361],"time,":[132,312],"high":[134],"probability.":[135],"On":[136],"other":[138],"hand,":[139],"best":[141],"deterministic":[143,195,229],"algorithm":[144,157,230,249,341],"requires":[146],"polylogarithmic":[147,196,241],"employs":[149,232],"2":[153,192],"colors.":[155],"This":[156],"was":[158],"devised":[159],"seminal":[162],"FOCS\u201987":[163],"paper":[164],"by":[165],"Linial":[166,181,203],"[1987].":[167],"Its":[168],"*":[174],").":[176,365],"same":[179],"article,":[180,218],"asked":[182],"whether":[183],"one":[184,205],"can":[185,274],"significantly":[188],"less":[189],"time.":[197,242],"By":[198],"now,":[199],"question":[201,222],"became":[204],"most":[208],"central":[209],"long-standing":[210],"open":[211],"questions":[212],"area.":[215],"we":[219],"answer":[220],"affirmative,":[225],"devise":[227],"1+":[234,281,347],"o":[235],"(1)":[236],"colors,":[237],"runs":[239],"our":[248,340],"f":[253,266],")log":[256],"log":[258,288,309,363],"),":[260],"arbitrarily":[263,293,315,352],"slow-growing":[264],"function":[265],"\u03c9":[271],"(1).":[272],"We":[273],"also":[275],"\u03b7":[282,296,348,355],")-coloring":[283,304],")-time,":[290],"small":[294,316,353],"constant":[295,317,354],">":[297,319,356],"0,":[298,357],"\u0394\u03f5":[308],"\u03f5":[318],"0.":[320],"Our":[321],"results":[322],"are,":[323],"fact,":[325],"far":[326],"general":[328],"this.":[330],"particular,":[332],"arboricity":[337],"produces":[342],")-coloring,":[349]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}