{"id":"https://openalex.org/W2480829993","doi":"https://doi.org/10.1145/2933057.2933079","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2480829993","doi":"https://doi.org/10.1145/2933057.2933079","mag":"2480829993"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933079","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933079","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933079&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2933079&type=pdf","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\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":"Yi-Jun Chang","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028866207","display_name":"Tsvi Kopelowitz","orcid":null},"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":"Tsvi Kopelowitz","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"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":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061847213"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.7188,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75285974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"195","last_page":"197"},"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.9998000264167786,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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/randomized-algorithm","display_name":"Randomized algorithm","score":0.6169561147689819},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5960632562637329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5720210671424866},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.552971363067627},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5456543564796448},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4912840723991394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43291494250297546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43141013383865356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37257811427116394},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32198047637939453},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3012590706348419}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6169561147689819},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5960632562637329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5720210671424866},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.552971363067627},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5456543564796448},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4912840723991394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43291494250297546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43141013383865356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37257811427116394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32198047637939453},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3012590706348419},{"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/2933057.2933079","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933079","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933079&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2933057.2933079","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933079","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933079&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1315261542","display_name":null,"funder_award_id":"CCF-1217338, CNS-1318294, CCF-1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2480829993.pdf","grobid_xml":"https://content.openalex.org/works/W2480829993.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1957963525","https://openalex.org/W1970330908","https://openalex.org/W1987125980","https://openalex.org/W1989134823","https://openalex.org/W1998643836","https://openalex.org/W2009970369","https://openalex.org/W2011595776","https://openalex.org/W2017345786","https://openalex.org/W2022155283","https://openalex.org/W2035362408","https://openalex.org/W2036489778","https://openalex.org/W2054910423","https://openalex.org/W2110673270","https://openalex.org/W2131848219","https://openalex.org/W2243868910","https://openalex.org/W2279830512","https://openalex.org/W2294368603","https://openalex.org/W2403340448","https://openalex.org/W2467514673","https://openalex.org/W2963181990","https://openalex.org/W2963714020"],"related_works":["https://openalex.org/W2112526268","https://openalex.org/W2174440985","https://openalex.org/W1964089073","https://openalex.org/W2011643166","https://openalex.org/W2279830512","https://openalex.org/W2119226317","https://openalex.org/W2058681277","https://openalex.org/W2154716867","https://openalex.org/W2951573806","https://openalex.org/W2049645503"],"abstract_inverted_index":{"Over":[0],"the":[1,15,30,40,60,66],"past":[2],"30":[3],"years":[4],"numerous":[5,57],"algorithms":[6],"have":[7],"been":[8],"designed":[9],"for":[10],"symmetry":[11],"breaking":[12],"problems":[13,29],"in":[14,65],"LOCAL":[16,67],"model,":[17],"such":[18],"as":[19],"maximal":[20],"matching,":[21],"MIS,":[22],"vertex":[23],"coloring,":[24],"and":[25,55,62],"edgecoloring.":[26],"For":[27],"most":[28],"best":[31,41],"randomized":[32,63],"algorithm":[33],"is":[34],"at":[35],"least":[36],"exponentially":[37],"faster":[38],"than":[39],"deterministic":[42,61],"algorithm.":[43],"In":[44],"this":[45],"paper":[46],"we":[47],"prove":[48],"that":[49],"these":[50],"exponential":[51],"gaps":[52],"are":[53],"necessary":[54],"establish":[56],"connections":[58],"between":[59],"complexities":[64],"model.":[68],"Each":[69],"of":[70],"our":[71],"results":[72],"has":[73],"a":[74],"very":[75],"compelling":[76],"take-away":[77],"message:":[78]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-08-23T00:00:00"}