{"id":"https://openalex.org/W3186734588","doi":"https://doi.org/10.1145/3465084.3467909","title":"Can We Break Symmetry with o(m) Communication?","display_name":"Can We Break Symmetry with o(m) Communication?","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3186734588","doi":"https://doi.org/10.1145/3465084.3467909","mag":"3186734588"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467909","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465084.3467909","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465084.3467909","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 2021 ACM 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/3465084.3467909","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051339127","display_name":"Shreyas Pai","orcid":"https://orcid.org/0000-0003-2409-7807"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shreyas Pai","raw_affiliation_strings":["University of Iowa, Iowa City, IA, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","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, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013414239","display_name":"Sriram V. Pemmaraju","orcid":"https://orcid.org/0000-0002-0834-3476"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sriram V. Pemmaraju","raw_affiliation_strings":["University of Iowa, Iowa City, IA, USA"],"affiliations":[{"raw_affiliation_string":"University of Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103150417","display_name":"Peter Robinson","orcid":"https://orcid.org/0000-0002-7442-7002"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["City University of Hong Kong, Kowloon Tong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051339127"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":0.1626,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.49135343,"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":"247","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/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/sublinear-function","display_name":"Sublinear function","score":0.7692482471466064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6528418660163879},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6260600686073303},{"id":"https://openalex.org/keywords/symmetry","display_name":"Symmetry (geometry)","score":0.478387713432312},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4405983090400696},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41671693325042725},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38623881340026855},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36905190348625183},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34864407777786255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30792495608329773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25194865465164185}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7692482471466064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6528418660163879},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6260600686073303},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.478387713432312},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4405983090400696},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41671693325042725},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38623881340026855},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36905190348625183},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34864407777786255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30792495608329773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25194865465164185},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3465084.3467909","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465084.3467909","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465084.3467909","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 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/ff758a3d-040a-4254-8a26-ad03911766d1","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/ff758a3d-040a-4254-8a26-ad03911766d1","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Pai, S, Pandurangan, G, Pemmaraju, S V & Robinson, P 2021, Can We Break Symmetry with o ( m ) Communication? in PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 247\u2013257, 2021 ACM Symposium on Principles of Distributed Computing (PODC \u201921), Italy, 26/07/21. https://doi.org/10.1145/3465084.3467909","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3465084.3467909","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465084.3467909","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465084.3467909","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 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G199314446","display_name":"A Novel Mechanism for Pyrimidine Methylation by a Flavin-dependent Enzyme","funder_award_id":"1213620","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/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/G7626077044","display_name":null,"funder_award_id":"Project No. 7200639/CS","funder_id":"https://openalex.org/F4320309893","funder_display_name":"City University of Hong Kong"},{"id":"https://openalex.org/G8441044163","display_name":null,"funder_award_id":"1955939","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/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/F4320309893","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3186734588.pdf","grobid_xml":"https://content.openalex.org/works/W3186734588.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1499928746","https://openalex.org/W1666479227","https://openalex.org/W1945584931","https://openalex.org/W1970330908","https://openalex.org/W1972418517","https://openalex.org/W1982792741","https://openalex.org/W1987099434","https://openalex.org/W1992776880","https://openalex.org/W2022143201","https://openalex.org/W2023146810","https://openalex.org/W2042437235","https://openalex.org/W2051586153","https://openalex.org/W2054910423","https://openalex.org/W2056316084","https://openalex.org/W2063844956","https://openalex.org/W2071114738","https://openalex.org/W2086604416","https://openalex.org/W2088374619","https://openalex.org/W2161176300","https://openalex.org/W2295428206","https://openalex.org/W2772780650","https://openalex.org/W2808433750","https://openalex.org/W2899464442","https://openalex.org/W2902010279","https://openalex.org/W2953271509","https://openalex.org/W2953390354","https://openalex.org/W2962677563","https://openalex.org/W2963239148","https://openalex.org/W2963420932","https://openalex.org/W2982573470","https://openalex.org/W3014095280","https://openalex.org/W3022417154","https://openalex.org/W3034790637","https://openalex.org/W3046714641","https://openalex.org/W3104611438","https://openalex.org/W3115241531","https://openalex.org/W3160042479","https://openalex.org/W3171180074","https://openalex.org/W4205469090","https://openalex.org/W4205550388"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2052708136","https://openalex.org/W2809723425","https://openalex.org/W2005302727","https://openalex.org/W4289097813","https://openalex.org/W3082028334","https://openalex.org/W1973725449","https://openalex.org/W2891477601"],"abstract_inverted_index":{"We":[0,68],"study":[1],"the":[2,28,39,61,66],"communication":[3,54],"cost":[4],"(or":[5],"message":[6,40],"complexity)":[7],"of":[8,31,42,63],"fundamental":[9],"distributed":[10],"symmetry":[11],"breaking":[12],"problems,":[13,33,57],"namely,":[14],"coloring":[15,81],"and":[16,26,82,89],"MIS.":[17],"While":[18],"significant":[19],"progress":[20],"has":[21],"been":[22],"made":[23],"in":[24,65,72],"understanding":[25],"improving":[27],"running":[29],"time":[30],"such":[32,79],"much":[34],"less":[35],"is":[36,60],"known":[37,48],"about":[38],"complexity":[41],"these":[43,56],"problems.":[44],"In":[45],"fact,":[46],"all":[47],"algorithms":[49],"need":[50],"at":[51],"least":[52],"\u03a9(m)":[53],"for":[55],"where":[58],"m":[59],"number":[62],"edges":[64],"graph.":[67],"addressthe":[69],"following":[70],"question":[71],"this":[73],"paper:":[74],"can":[75],"we":[76],"solve":[77],"problems":[78],"as":[80],"MIS":[83],"using":[84],"sublinear,":[85],"i.e.,":[86],"o(m)":[87],"communication,":[88],"if":[90],"sounder":[91],"what":[92],"conditions?":[93]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}