{"id":"https://openalex.org/W4285007266","doi":"https://doi.org/10.1145/3490148.3538566","title":"Average Awake Complexity of MIS and Matching","display_name":"Average Awake Complexity of MIS and Matching","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285007266","doi":"https://doi.org/10.1145/3490148.3538566"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078688453","display_name":"Julian Portmann","orcid":"https://orcid.org/0000-0002-8481-3986"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Julian Portmann","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.8763,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76182751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"55"},"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.9988999962806702,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9984999895095825,"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/chatterjee","display_name":"Chatterjee","score":0.6684117913246155},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6234652996063232},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.570294201374054},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5589912533760071},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5571364164352417},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.524447500705719},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5052769780158997},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5020177364349365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48100337386131287},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47438815236091614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46570852398872375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44289225339889526},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44202908873558044},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4323671758174896},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43057870864868164},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.41619405150413513},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4120682179927826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40579938888549805},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4032505750656128},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14370489120483398},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10740670561790466},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0959177315235138}],"concepts":[{"id":"https://openalex.org/C2779379073","wikidata":"https://www.wikidata.org/wiki/Q5087932","display_name":"Chatterjee","level":3,"score":0.6684117913246155},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6234652996063232},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.570294201374054},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5589912533760071},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5571364164352417},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.524447500705719},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5052769780158997},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5020177364349365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48100337386131287},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47438815236091614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46570852398872375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44289225339889526},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44202908873558044},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4323671758174896},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43057870864868164},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.41619405150413513},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4120682179927826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40579938888549805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4032505750656128},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14370489120483398},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10740670561790466},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0959177315235138},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C19235068","wikidata":"https://www.wikidata.org/wiki/Q9610","display_name":"Bengali","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538566","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1518319036","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1970330908","https://openalex.org/W1977066974","https://openalex.org/W1992776880","https://openalex.org/W1997707549","https://openalex.org/W2011595776","https://openalex.org/W2022155283","https://openalex.org/W2056316084","https://openalex.org/W2100061495","https://openalex.org/W2112009244","https://openalex.org/W2151690061","https://openalex.org/W2165441947","https://openalex.org/W2275325805","https://openalex.org/W2467514673","https://openalex.org/W2738712979","https://openalex.org/W2748046883","https://openalex.org/W2788015272","https://openalex.org/W2902010279","https://openalex.org/W2914057381","https://openalex.org/W2953390354","https://openalex.org/W2954841372","https://openalex.org/W2962844160","https://openalex.org/W3046807936","https://openalex.org/W3117607498"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W2123112061","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1994598067","https://openalex.org/W2963903795","https://openalex.org/W3097369619","https://openalex.org/W2899261484","https://openalex.org/W2137594557","https://openalex.org/W2902010279"],"abstract_inverted_index":{"Chatterjee,":[0],"Gmyr,":[1],"and":[2,36,155,163,178,190],"Pandurangan":[3],"[PODC":[4],"2020]":[5],"recently":[6],"introduced":[7],"the":[8,18,29,32,43,80,95,100,109,112,119,172],"notion":[9],"of":[10,20,45,50,55,66,124,187,193],"awake":[11,46,91,97,153,176],"complexity":[12,116,154,177,183],"for":[13,79,184],"distributed":[14,56,143],"algorithms,":[15],"which":[16,23],"measures":[17],"number":[19,44],"rounds":[21,47],"in":[22,52,59],"a":[24,140],"node":[25,33],"is":[26,34,65,102,137,167],"awake.":[27],"In":[28,68],"other":[30],"rounds,":[31],"sleeping":[35],"performs":[37],"no":[38],"computation":[39],"or":[40],"communication.":[41],"Measuring":[42],"can":[48],"be":[49],"significance":[51],"many":[53],"settings":[54],"computing,":[57],"e.g.,":[58],"sensor":[60],"networks":[61],"where":[62,197],"energy":[63],"consumption":[64],"concern.":[67],"that":[69,86],"paper,":[70],"Chatterjee":[71],"et":[72],"al.":[73],"provide":[74],"an":[75,88,200],"elegant":[76],"randomized":[77,142],"algorithm":[78,110,145],"Maximal":[81],"Independent":[82],"Set":[83],"(MIS)":[84],"problem":[85],"achieves":[87],"O(1)":[89,103,151,174],"node-averaged":[90,152,175],"complexity.":[92,160],"That":[93],"is,":[94],"average":[96],"time":[98],"among":[99],"nodes":[101],"rounds.":[104,133],"However,":[105],"to":[106,127,130,138,168],"achieve":[107],"that,":[108,146],"sacrifices":[111],"more":[113,164],"standard":[114],"round":[115,159,182],"measure":[117],"from":[118],"well-known":[120],"O(\u0142og":[121,156,179],"n)":[122,132,157,180],"bound":[123],"MIS,":[125],"due":[126],"Luby":[128],"[STOC'85],":[129],"O(\u0142og^3.41":[131],"Our":[134,161],"first":[135],"contribution":[136],"present":[139],"simple":[141],"MIS":[144],"with":[147,171],"high":[148],"probability,":[149],"has":[150],"worst-case":[158,181],"second,":[162],"technical":[165],"contribution,":[166],"show":[169],"algorithms":[170],"same":[173],"1+\u03b5":[185],"approximation":[186,192],"maximum":[188],"matching":[189],"2+\u03b5":[191],"minimum":[194],"vertex":[195],"cover,":[196],"\u03b5":[198],"denotes":[199],"arbitrary":[201],"small":[202],"positive":[203],"constant.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}