{"id":"https://openalex.org/W3046807936","doi":"https://doi.org/10.1145/3382734.3405718","title":"Sleeping is Efficient: MIS in <i>O</i> (1)-rounds Node-averaged Awake Complexity","display_name":"Sleeping is Efficient: MIS in <i>O</i> (1)-rounds Node-averaged Awake Complexity","publication_year":2020,"publication_date":"2020-07-31","ids":{"openalex":"https://openalex.org/W3046807936","doi":"https://doi.org/10.1145/3382734.3405718","mag":"3046807936"},"language":"en","primary_location":{"id":"doi:10.1145/3382734.3405718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th 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":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405718","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017753897","display_name":"Soumyottam Chatterjee","orcid":"https://orcid.org/0000-0002-0479-0690"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soumyottam Chatterjee","raw_affiliation_strings":["Georgetown University"],"affiliations":[{"raw_affiliation_string":"Georgetown University","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085084886","display_name":"Robert Gmyr","orcid":"https://orcid.org/0000-0002-2242-6083"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robert Gmyr","raw_affiliation_strings":["Microsoft"],"affiliations":[{"raw_affiliation_string":"Microsoft","institution_ids":["https://openalex.org/I4210164937"]}]},{"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":["University of Houston"],"affiliations":[{"raw_affiliation_string":"University of Houston","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017753897"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":2.312,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.90930851,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"108"},"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.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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.9990000128746033,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7186888456344604},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6503854990005493},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6223663091659546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5771697759628296},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5616985559463501},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5343707203865051},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4914933443069458},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4855794310569763},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.464793860912323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4031808078289032},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37936583161354065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35551899671554565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25003474950790405},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09134405851364136}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7186888456344604},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6503854990005493},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6223663091659546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5771697759628296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5616985559463501},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5343707203865051},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4914933443069458},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4855794310569763},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.464793860912323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4031808078289032},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37936583161354065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35551899671554565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25003474950790405},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09134405851364136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/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/3382734.3405718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3382734.3405718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3382734.3405718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3382734.3405718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1837716696","display_name":null,"funder_award_id":"IIS-1633720, CCF-1540512, CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G358386452","display_name":"AiTF: Collaborative Research: Algorithms for Smartphone Peer-to-Peer Networks","funder_award_id":"1733842","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/G7744142461","display_name":null,"funder_award_id":"2016419","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational 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/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"},{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3046807936.pdf","grobid_xml":"https://content.openalex.org/works/W3046807936.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1743004868","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1965630875","https://openalex.org/W1977066974","https://openalex.org/W2026143151","https://openalex.org/W2042685720","https://openalex.org/W2067883080","https://openalex.org/W2086455839","https://openalex.org/W2100061495","https://openalex.org/W2104142168","https://openalex.org/W2113613181","https://openalex.org/W2118288908","https://openalex.org/W2151636922","https://openalex.org/W2151690061","https://openalex.org/W2467514673","https://openalex.org/W2568091325","https://openalex.org/W2776603735","https://openalex.org/W2902010279","https://openalex.org/W2914057381","https://openalex.org/W2953390354","https://openalex.org/W2954841372","https://openalex.org/W3034790637","https://openalex.org/W4205300528","https://openalex.org/W4255054927"],"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,47,70],"one":[5],"of":[6,17,50],"the":[7,24,48,53,66],"fundamental":[8],"problems":[9],"in":[10],"distributed":[11,18],"computing.":[12],"The":[13,32],"round":[14],"(time)":[15],"complexity":[16],"MIS":[19,35],"has":[20,58],"traditionally":[21],"focused":[22],"on":[23,42],"worst-case":[25,40,56],"time":[26],"for":[27],"all":[28],"nodes":[29],"to":[30],"finish.":[31],"best-known":[33,67],"(randomized)":[34],"algorithms":[36],"take":[37],"O(log":[38,54],"n)":[39,55],"rounds":[41],"general":[43],"graphs":[44],"(where":[45],"n":[46],"number":[49],"nodes).":[51],"Breaking":[52],"bound":[57,69],"been":[59],"a":[60],"longstanding":[61],"open":[62],"problem,":[63],"while":[64],"currently":[65],"lower":[68],"[EQUATION]":[71],"rounds.":[72]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}