{"id":"https://openalex.org/W4380875778","doi":"https://doi.org/10.1145/3583668.3594587","title":"Distributed MIS with Low Energy and Time Complexities","display_name":"Distributed MIS with Low Energy and Time Complexities","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380875778","doi":"https://doi.org/10.1145/3583668.3594587"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594587","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063743357","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0003-4213-9898"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["MIT, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0003-4213-9898","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"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, Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-8481-3986","affiliations":[{"raw_affiliation_string":"ETH Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063743357"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.9699,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78770579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"146","last_page":"156"},"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.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.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.7973004579544067},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6561927795410156},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6555584669113159},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6030281186103821},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5856342315673828},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5786470174789429},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5735370516777039},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5711850523948669},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5033110976219177},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4978675842285156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49063602089881897},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4367508292198181},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4101242125034332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3759899437427521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13950765132904053}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7973004579544067},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6561927795410156},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6555584669113159},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6030281186103821},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5856342315673828},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5786470174789429},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5735370516777039},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5711850523948669},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5033110976219177},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4978675842285156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49063602089881897},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4367508292198181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4101242125034332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3759899437427521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13950765132904053},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583668.3594587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594587","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9200000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W138321218","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1975508847","https://openalex.org/W2054910423","https://openalex.org/W2087596759","https://openalex.org/W2100061495","https://openalex.org/W2108820146","https://openalex.org/W2554518674","https://openalex.org/W2555333713","https://openalex.org/W2902010279","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/W4285007266","https://openalex.org/W4286501311","https://openalex.org/W4316652339"],"related_works":["https://openalex.org/W2792172447","https://openalex.org/W4224883704","https://openalex.org/W2798294881","https://openalex.org/W2950943763","https://openalex.org/W2085382249","https://openalex.org/W961142965","https://openalex.org/W1548306442","https://openalex.org/W2800933960","https://openalex.org/W2113623403","https://openalex.org/W119245487"],"abstract_inverted_index":{"We":[0],"present":[1],"randomized":[2],"distributed":[3,37],"algorithms":[4,29],"for":[5],"the":[6,15,20,24,32,49,54,60,71],"maximal":[7],"independent":[8],"set":[9],"problem":[10],"(MIS)":[11],"that,":[12],"while":[13],"keeping":[14],"time":[16,46],"complexity":[17,26,47,58],"nearly":[18],"matching":[19],"best":[21],"known,":[22],"reduce":[23],"energy":[25,57],"substantially.":[27],"These":[28],"work":[30],"in":[31,53],"standard":[33],"CONGEST":[34],"model":[35],"of":[36,51,62],"message":[38],"passing":[39],"with":[40],"O(log":[41],"n)":[42],"bit":[43],"messages.":[44],"The":[45,56],"measures":[48,59],"number":[50,61],"rounds":[52,63],"algorithm.":[55],"each":[64],"node":[65,72],"is":[66],"awake;":[67],"during":[68],"other":[69],"rounds,":[70],"sleeps":[73],"and":[74],"cannot":[75],"perform":[76],"any":[77],"computation":[78],"or":[79],"communications.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}