{"id":"https://openalex.org/W2554518674","doi":"https://doi.org/10.1145/2979675","title":"Deterministic (\u0394 + 1)-Coloring in Sublinear (in \u0394) Time in Static, Dynamic, and Faulty Networks","display_name":"Deterministic (\u0394 + 1)-Coloring in Sublinear (in \u0394) Time in Static, Dynamic, and Faulty Networks","publication_year":2016,"publication_date":"2016-11-08","ids":{"openalex":"https://openalex.org/W2554518674","doi":"https://doi.org/10.1145/2979675","mag":"2554518674"},"language":"en","primary_location":{"id":"doi:10.1145/2979675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2979675","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/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, Raanana"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Raanana","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057471294"],"corresponding_institution_ids":["https://openalex.org/I164950643"],"apc_list":null,"apc_paid":null,"fwci":7.3175,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97326598,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"63","issue":"5","first_page":"1","last_page":"22"},"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.9997000098228455,"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.9997000098228455,"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.9972000122070312,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6936906576156616},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5823497772216797},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5645509958267212},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5620729923248291},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.560410737991333},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5568985342979431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47600993514060974},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4669545590877533},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43911731243133545},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4375803470611572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4249758720397949},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.41376280784606934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26533710956573486},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07750317454338074}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6936906576156616},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5823497772216797},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5645509958267212},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5620729923248291},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.560410737991333},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5568985342979431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47600993514060974},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4669545590877533},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43911731243133545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4375803470611572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4249758720397949},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.41376280784606934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26533710956573486},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07750317454338074},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2979675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2979675","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1892691276","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1987125980","https://openalex.org/W1996066664","https://openalex.org/W1998643836","https://openalex.org/W2006040238","https://openalex.org/W2007218972","https://openalex.org/W2011894656","https://openalex.org/W2022781277","https://openalex.org/W2034499376","https://openalex.org/W2065967498","https://openalex.org/W2077059864","https://openalex.org/W2083116840","https://openalex.org/W2100061495","https://openalex.org/W2109368894","https://openalex.org/W2112009244","https://openalex.org/W2118288908","https://openalex.org/W2136185479","https://openalex.org/W2157459553","https://openalex.org/W2157562188","https://openalex.org/W2160645744","https://openalex.org/W2161176300","https://openalex.org/W2164604747","https://openalex.org/W2169102947","https://openalex.org/W2174965586","https://openalex.org/W2294368603","https://openalex.org/W2601662790","https://openalex.org/W2953271509","https://openalex.org/W4205300528","https://openalex.org/W4241904697","https://openalex.org/W4253998201","https://openalex.org/W4301085782"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W4297911588","https://openalex.org/W2793500002","https://openalex.org/W2380525562","https://openalex.org/W4229747356","https://openalex.org/W398688634","https://openalex.org/W2385428710"],"abstract_inverted_index":{"We":[0,274],"study":[1],"the":[2,16,31,85,98,158,174,211,249,276,312,355,367,373],"distributed":[3,24,103],"(\u0394":[4,133,147,216,320],"+":[5,134,151,183,188,196,217],"1)-vertex-coloring":[6,135],"and":[7,19,56,71,75,79,107,116,122,136,161,186,224,230,379],"(2\u0394":[8,137],"\u2212":[9,138],"1)-edge-coloring":[10,139],"problems.":[11],"These":[12,341],"problems":[13,22,40,59],"are":[14,61,235,258],"among":[15],"most":[17,99],"important":[18,339],"intensively":[20],"studied":[21],"in":[23,30,102,157,171,303,337,344,372],"computing.":[25],"Despite":[26],"very":[27],"intensive":[28],"research":[29],"last":[32],"30":[33],"years,":[34],"no":[35],"deterministic":[36,142,201],"algorithms":[37,89,143,193,365],"for":[38,52,132,181,264,317],"these":[39,292],"with":[41,194,285,366],"sublinear":[42],"(in":[43],"\u0394)":[44],"time":[45,156,222,370],"have":[46],"been":[47],"known":[48,270],"so":[49],"far.":[50],"Moreover,":[51,180,359],"more":[53,237,327,374],"restricted":[54],"scenarios":[55],"some":[57],"related":[58],"there":[60],"lower":[62,175],"bounds":[63],"of":[64,84,97,173,177,248,283,301,314,334,347,377],"\u03a9(\u0394)":[65],"[G\u00f6\u00f6s":[66],"et":[67,112],"al.":[68,113],"2014;":[69,114],"Hirvonen":[70,115],"Suomela":[72,117],"2012;":[73,118],"Kuhn":[74,119,227],"Wattenhofer":[76],"2006;":[77],"Szegedy":[78],"Vishwanathan":[80],"1993].":[81],"The":[82],"question":[83,131],"possibility":[86],"to":[87,210,245,351,363],"devise":[88,192,364],"that":[90,144,213,240,252,298,330,333],"overcome":[91],"this":[92,126,130],"challenging":[93],"barrier":[94],"is":[95,169,204,309,325],"one":[96],"fundamental":[100],"questions":[101],"symmetry":[104],"breaking":[105],"[Barenboim":[106,223],"Elkin":[108,225],"2009,":[109],"2011;":[110],"G\u00f6\u00f6s":[111],"2009;":[120,226,228],"Panconesi":[121,229],"Rizzi":[123,231],"2001].":[124,232],"In":[125],"article,":[127],"we":[128,191,290],"settle":[129],"by":[140,311],"devising":[141],"require":[145],"O":[146,215,319,356],"3/4":[148],"log":[149,152,166,197,218],"\u0394":[150],"*":[153,167,198,219],"n":[154,168,199,220],")":[155,200,221],"static,":[159],"dynamic,":[160],"faulty":[162,380],"settings.":[163],"(The":[164],"term":[165],"unavoidable":[170],"view":[172],"bound":[176],"Linial":[178,315,335],"[1987].)":[179],"(1":[182],"o":[184,189],"(1))\u0394-vertex-coloring":[185],"(2":[187],"(1))\u0394-edge-coloring":[190],"\u00d5(\u221a\u0394":[195],"time.":[202],"This":[203],"roughly":[205],"a":[206,246,261,280,296,304,326],"quadratic":[207],"improvement":[208],"comparing":[209],"state-of-the-art":[212],"requires":[214],"Our":[233,256,307],"results":[234,257],"actually":[236],"general":[238],"than":[239],"since":[241],"they":[242,360],"apply":[243],"also":[244,371],"variant":[247],"list-coloring":[250],"problem":[251],"generalizes":[253],"ordinary":[254,318],"coloring.":[255],"obtained":[259],"using":[260,295,345],"novel":[262,305],"technique":[263,297],"coloring":[265],"partially":[266],"colored":[267],"graphs":[268],"(also":[269],"as":[271],"fixing":[272],").":[273],"partition":[275],"uncolored":[277],"parts":[278],"into":[279],"small":[281],"number":[282],"subgraphs":[284,293],"certain":[286],"helpful":[287],"properties.":[288],"Then":[289],"color":[291],"gradually":[294],"employs":[299],"constructions":[300],"polynomials":[302,348],"way.":[306],"construction":[308,329],"inspired":[310],"algorithm":[313],"[1987]":[316,336],"2":[321],")-coloring.":[322],"However,":[323],"it":[324],"sophisticated":[328],"differs":[331],"from":[332],"several":[338],"respects.":[340],"new":[342],"insights":[343],"systems":[346],"allow":[349,361],"us":[350,362],"significantly":[352],"speed":[353],"up":[354],"(\u0394)-coloring":[357],"algorithms.":[358],"same":[368],"running":[369],"complicated":[375],"settings":[376],"dynamic":[378],"networks.":[381]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}