{"id":"https://openalex.org/W2913663107","doi":"https://doi.org/10.1137/17m1117537","title":"An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model","display_name":"An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2913663107","doi":"https://doi.org/10.1137/17m1117537","mag":"2913663107"},"language":"en","primary_location":{"id":"doi:10.1137/17m1117537","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1117537","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["University of Michigan","Tsvi Kopelowitz University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Tsvi Kopelowitz University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028866207","display_name":"Tsvi Kopelowitz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tsvi Kopelowitz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["Tsvi Kopelowitz University of Michigan","University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsvi Kopelowitz University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":6.3628,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.9698037,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"48","issue":"1","first_page":"122","last_page":"143"},"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.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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973999857902527,"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/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.789076566696167},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7416061758995056},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6784796714782715},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6711204051971436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6420505046844482},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5225193500518799},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4789370000362396},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47612911462783813},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.46191927790641785}],"concepts":[{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.789076566696167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7416061758995056},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6784796714782715},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6711204051971436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6420505046844482},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5225193500518799},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4789370000362396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47612911462783813},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.46191927790641785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1117537","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1117537","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3198296171","display_name":"AF:Small:Data Structures for Dynamic Networks","funder_award_id":"1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5525452677","display_name":null,"funder_award_id":"CNS-1318294","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7974033425","display_name":null,"funder_award_id":"CCF-1217338","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8021246916","display_name":"TWC: Small: Collaborative: Cost-Competitve Analysis - A New Tool for Designing Secure Systems","funder_award_id":"1318294","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8864822960","display_name":"AF:  Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8959633998","display_name":null,"funder_award_id":"CCF-1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1957963525","https://openalex.org/W1970330908","https://openalex.org/W1980501142","https://openalex.org/W1989134823","https://openalex.org/W1998643836","https://openalex.org/W2004229660","https://openalex.org/W2006040238","https://openalex.org/W2017345786","https://openalex.org/W2022155283","https://openalex.org/W2035362408","https://openalex.org/W2036489778","https://openalex.org/W2054910423","https://openalex.org/W2056295140","https://openalex.org/W2110673270","https://openalex.org/W2136185479","https://openalex.org/W2467514673","https://openalex.org/W2626058046","https://openalex.org/W2797253418","https://openalex.org/W3103554207"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W3097369619","https://openalex.org/W2963181990","https://openalex.org/W2007715402","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2899261484","https://openalex.org/W2565109825"],"abstract_inverted_index":{"Over":[0],"the":[1,15,31,41,61,67,102,110,128,169,182,220,235,266,357,372,383,388,391,400],"past":[2],"30":[3],"years":[4],"numerous":[5,58],"algorithms":[6,367,396],"have":[7],"been":[8],"designed":[9],"for":[10,101,146,158,192,338,344],"symmetry":[11,365],"breaking":[12,366],"problems":[13,30,197],"in":[14,66,107,181,200,211,306,320,362,387],"LOCAL":[16,68,373],"model,":[17],"such":[18],"as":[19],"maximal":[20],"matching,":[21],"MIS,":[22],"vertex":[23],"coloring,":[24],"and":[25,56,63,174,313,394],"edge":[26],"coloring.":[27],"For":[28,375],"most":[29],"best":[32,42,392],"randomized":[33,64,91,129,267,294,348,364],"algorithm":[34,191,222,300],"is":[35,139,155,178,261,278,368,378],"at":[36,279],"least":[37,280],"exponentially":[38],"faster":[39],"than":[40],"deterministic":[43,62,153,170,183,190,282,333],"algorithm.":[44],"In":[45],"this":[46],"paper":[47],"we":[48,125],"prove":[49,126,264],"that":[50,127,188,198,234,247,265,292,331,356],"these":[51],"exponential":[52],"gaps":[53],"are":[54],"necessary":[55],"establish":[57],"connections":[59],"between":[60,168],"complexities":[65,389],"model.":[69,374],"Each":[70],"of":[71,82,94,109,116,131,172,196,269,275,286,390],"our":[72],"results":[73],"has":[74],"a":[75,89,133,165,179,193,224,250,332,342,347],"very":[76],"compelling":[77],"take-away":[78],"message:":[79],"Fast":[80],"$\\Delta$-coloring":[81,132,173,249],"trees":[83],"requires":[84,237],"random":[85],"bits.":[86],"Building":[87],"on":[88,114,273,284],"recent":[90,363],"lower":[92,99,225,336,352],"bound":[93,100,226,337],"Brandt":[95],"et":[96],"al.":[97],"[A":[98],"distributed":[103],"Lov\u00e1sz":[104],"local":[105],"lemma,":[106],"Proceedings":[108],"48th":[111],"ACM":[112],"Symposium":[113],"Theory":[115],"Computing":[117],"(STOC),":[118],"ACM,":[119],"New":[120],"York,":[121],"2016,":[122],"pp.":[123],"479--488],":[124],"complexity":[130,154,171,184,268,283],"tree":[134,251],"with":[135,252],"maximum":[136],"degree":[137],"$\\Delta$":[138,254],"$O(\\log_\\Delta":[140],"\\log":[141,298,350],"n":[142,213,322],"+":[143,202,216,296,309,325],"\\log^\\ast":[144],"n)$":[145,157,204,239,257,311,335,351],"any":[147,159,189,270,293,339],"$\\Delta":[148],"\\ge":[149],"55$,":[150],"whereas":[151],"its":[152,281],"$\\Omega(\\log_\\Delta":[156,238,256,334,349],"$\\Delta\\ge":[160],"3$.":[161],"This":[162,242,290,328],"also":[163,329,398],"establishes":[164],"large":[166],"separation":[167],"$(\\Delta+1)$-coloring":[175,395],"trees.":[176],"There":[177],"gap":[180],"hierarchy.":[185],"We":[186,263],"show":[187],"natural":[194,271],"class":[195],"runs":[199],"$O(1)":[201,295,308],"o(\\log_\\Delta":[203,297,310],"rounds":[205,312],"can":[206,232,301,315],"be":[207,302,316],"transformed":[208,221,317],"to":[209,304,318,371,381],"run":[210,305,319],"$O(\\log^*":[212,321],"-":[214,323],"\\log^*\\Delta":[215,324],"1)$":[217,326],"rounds.":[218,258,327],"If":[219],"violates":[223],"(even":[227],"allowing":[228],"randomization),":[229],"then":[230],"one":[231],"conclude":[233],"problem":[236,272,340],"time":[240],"deterministically.":[241],"gives":[243],"an":[244],"alternate":[245],"proof":[246],"deterministically":[248,307],"small":[253],"takes":[255],"Graph":[259],"shattering":[260,359],"necessary.":[262],"instances":[274,285],"size":[276,287],"$n$":[277],"$\\sqrt{\\log":[288],"n}$.":[289],"shows":[291,330],"n)$-round":[299],"derandomized":[303],"hence":[314],"($\\Delta$-coloring":[341],"tree,":[343],"example)":[345],"implies":[346],"bound.":[353],"It":[354],"illustrates":[355],"graph":[358],"technique":[360],"employed":[361],"absolutely":[369],"essential":[370],"example,":[376],"it":[377],"provably":[379],"impossible":[380],"improve":[382],"$2^{O(\\sqrt{\\log\\log":[384],"n})}$":[385],"terms":[386],"MIS":[393],"without":[397],"improving":[399],"$2^{O(\\sqrt{\\log":[401],"n})}$-round":[402],"Panconesi--Srinivasan":[403],"algorithms.":[404]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}