{"id":"https://openalex.org/W4415329264","doi":"https://doi.org/10.1145/3798129.3800816","title":"Breaking Barriers for Distributed MIS by Faster Degree Reduction","display_name":"Breaking Barriers for Distributed MIS by Faster Degree Reduction","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4415329264","doi":"https://doi.org/10.1145/3798129.3800816"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800816","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800816","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800816","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089384401","display_name":"Seri Khoury","orcid":"https://orcid.org/0000-0002-7491-5866"},"institutions":[{"id":"https://openalex.org/I58918642","display_name":"Sofia University \"St. Kliment Ohridski\"","ror":"https://ror.org/02jv3k292","country_code":"BG","type":"education","lineage":["https://openalex.org/I58918642"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Seri Khoury","raw_affiliation_strings":["INSAIT at Sofia University St. Kliment Ohridski, Sofia, Bulgaria"],"raw_orcid":"https://orcid.org/0000-0002-7491-5866","affiliations":[{"raw_affiliation_string":"INSAIT at Sofia University St. Kliment Ohridski, Sofia, Bulgaria","institution_ids":["https://openalex.org/I58918642"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063643701","display_name":"Aaron Schild","orcid":"https://orcid.org/0000-0003-0476-6479"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Schild","raw_affiliation_strings":["Google Research, Mountain View, USA"],"raw_orcid":"https://orcid.org/0000-0003-0476-6479","affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0066092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1037","last_page":"1048"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.810699999332428,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.810699999332428,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.7530999779701233,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.6941999793052673,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/maximal-independent-set","display_name":"Maximal independent set","score":0.5688999891281128},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49810001254081726},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4494999945163727},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.43810001015663147},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4375999867916107},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42730000615119934},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4129999876022339},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.3970000147819519},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.392300009727478}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6428999900817871},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5688999891281128},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.536300003528595},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4896000027656555},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.43810001015663147},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4375999867916107},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42730000615119934},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4129999876022339},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3970000147819519},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.392300009727478},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.37689998745918274},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3449999988079071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.326200008392334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3131999969482422},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29260000586509705},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.26899999380111694},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26429998874664307}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800816","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800816","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2505.15652","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.15652","pdf_url":"https://arxiv.org/pdf/2505.15652","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2505.15652","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.15652","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800816","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800816","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,12,46,58,63],"problem":[3],"of":[4,16,44,48,57],"finding":[5],"a":[6],"maximal":[7],"independent":[8],"set":[9],"(MIS)":[10],"in":[11,33,36,62],"standard":[13],"LOCAL":[14],"model":[15],"distributed":[17],"computing.":[18],"Classical":[19],"algorithms":[20],"by":[21],"Luby":[22],"[JACM\u201986]":[23],"and":[24,27],"Alon,":[25],"Babai,":[26],"Itai":[28],"[JALG\u201986]":[29],"find":[30],"an":[31],"MIS":[32],"O(logn)":[34],"rounds":[35],"n-node":[37],"graphs":[38,54],"with":[39],"high":[40],"probability.":[41],"Despite":[42],"decades":[43],"research,":[45],"existence":[47],"any":[49],"o(logn)-round":[50],"algorithm":[51],"for":[52],"general":[53],"remains":[55],"one":[56],"major":[59],"open":[60],"problems":[61],"field.":[64]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-19T00:00:00"}