{"id":"https://openalex.org/W4380873944","doi":"https://doi.org/10.1145/3583668.3594574","title":"Distributed MIS in O(log log n) Awake Complexity","display_name":"Distributed MIS in O(log log n) Awake Complexity","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380873944","doi":"https://doi.org/10.1145/3583668.3594574"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594574","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/preview/1134110/38773.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065366908","display_name":"Fabien Dufoulon","orcid":"https://orcid.org/0000-0003-2977-4109"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fabien Dufoulon","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Houston, Texas, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070835473","display_name":"William K. Moses","orcid":"https://orcid.org/0000-0002-4533-7593"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"William K. Moses","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, Texas, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Houston, Texas, United States of America","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065366908"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":1.7696,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86970662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"145"},"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.9994999766349792,"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.9980000257492065,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7155992984771729},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7065800428390503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6204771995544434},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5776498317718506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5717495679855347},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46802932024002075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4467068314552307},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4427812099456787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4104301929473877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33389782905578613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19980508089065552}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7155992984771729},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7065800428390503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6204771995544434},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5776498317718506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717495679855347},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46802932024002075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4467068314552307},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4427812099456787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4104301929473877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33389782905578613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19980508089065552},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3583668.3594574","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:38773","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/38773/","pdf_url":"https://durham-repository.worktribe.com/preview/1134110/38773.pdf","source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Orlando, Florida, 19-23 June 2023 [Conference proceedings]","raw_type":"Conference item"},{"id":"pmh:oai:durham-repository.worktribe.com:1134089","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1134089","pdf_url":"https://durham-repository.worktribe.com/file/1134089/1/Accepted%20Conference%20Proceeding","source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:dro.dur.ac.uk.OAI2:38773","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/38773/","pdf_url":"https://durham-repository.worktribe.com/preview/1134110/38773.pdf","source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Orlando, Florida, 19-23 June 2023 [Conference proceedings]","raw_type":"Conference item"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G24500667","display_name":null,"funder_award_id":"CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3389892740","display_name":"CCF-BSF: AF:Small: Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3829831297","display_name":"BIGDATA: Collaborative Research: F: Efficient Distributed Computation of Large-Scale Graph Problems in Epidemiology and Contagion Dynamics","funder_award_id":"1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6111813407","display_name":null,"funder_award_id":"IIS-1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G844817646","display_name":null,"funder_award_id":"CCF-1540512","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8925879480","display_name":"BSF:2014424:Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1540512","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380873944.pdf","grobid_xml":"https://content.openalex.org/works/W4380873944.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1250011919","https://openalex.org/W1743004868","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1965630875","https://openalex.org/W2022155283","https://openalex.org/W2028270449","https://openalex.org/W2042685720","https://openalex.org/W2045959199","https://openalex.org/W2074687256","https://openalex.org/W2086455839","https://openalex.org/W2087596759","https://openalex.org/W2100061495","https://openalex.org/W2113613181","https://openalex.org/W2114786478","https://openalex.org/W2151636922","https://openalex.org/W2186715137","https://openalex.org/W2248643692","https://openalex.org/W2776603735","https://openalex.org/W2908664940","https://openalex.org/W2953390354","https://openalex.org/W2963550269","https://openalex.org/W3034790637","https://openalex.org/W3046532547","https://openalex.org/W3046807936","https://openalex.org/W3117607498","https://openalex.org/W3183543397","https://openalex.org/W4205300528","https://openalex.org/W4286501311"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W3095925971","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2005304136","https://openalex.org/W1968512104","https://openalex.org/W1862126075"],"abstract_inverted_index":{"Maximal":[0],"Independent":[1],"Set":[2],"(MIS)":[3],"is":[4,43,54],"one":[5],"of":[6,21,46],"the":[7,24,44,49,63],"fundamental":[8],"and":[9],"most":[10],"well-studied":[11],"problems":[12],"in":[13],"distributed":[14],"graph":[15],"algorithms.":[16],"Even":[17],"after":[18],"four":[19],"decades":[20],"intensive":[22],"research,":[23],"best":[25,50],"known":[26,51],"(randomized)":[27],"MIS":[28],"algorithms":[29],"have":[30,75],"O(log":[31,64],"n)":[32,65],"round":[33,66],"complexity":[34,67],"on":[35],"general":[36],"graphs":[37],"[Luby,":[38],"STOC":[39],"1986]":[40],"(where":[41],"n":[42],"number":[45],"nodes),":[47],"while":[48],"lower":[52,73],"bound":[53,69],"[EQUATION]":[55],"[Kuhn,":[56],"Moscibroda,":[57],"Wattenhofer,":[58],"JACM":[59],"2016].":[60],"Breaking":[61],"past":[62],"upper":[68],"or":[70],"showing":[71],"stronger":[72],"bounds":[74],"been":[76],"longstanding":[77],"open":[78],"problems.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}