{"id":"https://openalex.org/W2772780650","doi":"https://doi.org/10.1145/3188745.3188964","title":"An optimal distributed (\u0394+1)-coloring algorithm?","display_name":"An optimal distributed (\u0394+1)-coloring algorithm?","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2772780650","doi":"https://doi.org/10.1145/3188745.3188964","mag":"2772780650"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188964","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188964","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188964","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188964","any_repository_has_fulltext":null},"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","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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101412259","display_name":"Wenzheng Li","orcid":"https://orcid.org/0009-0008-4536-8948"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenzheng Li","raw_affiliation_strings":["Tsinghua University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]}]},{"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","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"445","last_page":"456"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6375920176506042},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5938839316368103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5524196624755859},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.528785765171051},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4933392107486725},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4376559257507324},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4275500774383545},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3650576174259186},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25066787004470825}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6375920176506042},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5938839316368103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5524196624755859},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.528785765171051},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4933392107486725},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4376559257507324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4275500774383545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3650576174259186},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25066787004470825}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3188745.3188964","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188964","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188964","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3188745.3188964","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188964","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188964","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2447562502","display_name":null,"funder_award_id":"CCF-1514383, CCF-1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4167357606","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6809486582","display_name":null,"funder_award_id":"CCF-1637546","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2772780650.pdf","grobid_xml":"https://content.openalex.org/works/W2772780650.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1666479227","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1970330908","https://openalex.org/W1983214236","https://openalex.org/W1989274820","https://openalex.org/W1996066664","https://openalex.org/W1997988698","https://openalex.org/W1998643836","https://openalex.org/W2009524061","https://openalex.org/W2033177550","https://openalex.org/W2054910423","https://openalex.org/W2056316084","https://openalex.org/W2071114738","https://openalex.org/W2100061495","https://openalex.org/W2103012681","https://openalex.org/W2109368894","https://openalex.org/W2119761906","https://openalex.org/W2136185479","https://openalex.org/W2163371823","https://openalex.org/W2279830512","https://openalex.org/W2294368603","https://openalex.org/W2467514673","https://openalex.org/W2607483562","https://openalex.org/W2609730020","https://openalex.org/W2767995863","https://openalex.org/W2963714020","https://openalex.org/W2963830589","https://openalex.org/W4254031789"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W4287691960","https://openalex.org/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2963181990","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2565109825"],"abstract_inverted_index":{"Vertex":[0],"coloring":[1,24,45],"is":[2,39,79,82],"one":[3],"of":[4,43,61,91],"the":[5,26,40,86],"classic":[6],"symmetry":[7],"breaking":[8],"problems":[9],"studied":[10],"in":[11,25,31],"distributed":[12],"computing.":[13],"In":[14],"this":[15],"paper":[16],"we":[17],"present":[18],"a":[19,57],"new":[20],"algorithm":[21,60,90],"for":[22],"(\u0394+1)-list":[23],"randomized":[27,59],"LOCAL":[28],"model":[29],"running":[30],"O(log\u2217n":[32],"+":[33,71,73,101],"Detd(poly":[34,74],"logn))":[35],"time,":[36],"where":[37],"Detd(n\u2032)":[38],"deterministic":[41,89],"complexity":[42,69,99],"(deg+1)-list":[44],"(v\u2019s":[46],"palette":[47],"has":[48],"size":[49],"deg(v)+1)":[50],"on":[51],"n\u2032-vertex":[52],"graphs.":[53],"This":[54],"improves":[55],"upon":[56],"previous":[58],"Harris,":[62],"Schneider,":[63],"and":[64,76,94],"Su":[65],"(STOC":[66],"2016).":[67],"with":[68,98],"O(\u221alog\u0394":[70],"loglogn":[72],"logn)),":[75],"(when":[77],"\u0394":[78],"sufficiently":[80],"large)":[81],"much":[83],"faster":[84],"than":[85],"best":[87],"known":[88],"Fraigniaud,":[92],"Heinrich,":[93],"Kosowski":[95],"(FOCS":[96],"2016),":[97],"O(\u221a\u0394log2.5\u0394":[100],"log*":[102],"n).":[103]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}