{"id":"https://openalex.org/W4380874718","doi":"https://doi.org/10.1145/3583668.3594575","title":"Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?","display_name":"Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380874718","doi":"https://doi.org/10.1145/3583668.3594575"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594575","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/A5103150417","display_name":"Peter Robinson","orcid":"https://orcid.org/0000-0002-7442-7002"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["Augusta University, Augusta, USA"],"raw_orcid":"https://orcid.org/0000-0002-7442-7002","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, USA","institution_ids":["https://openalex.org/I25041050"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103150417"],"corresponding_institution_ids":["https://openalex.org/I25041050"],"apc_list":null,"apc_paid":null,"fwci":0.5819,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70300053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"171"},"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.9998000264167786,"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.9998000264167786,"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.996399998664856,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9947999715805054,"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/unicast","display_name":"Unicast","score":0.9141862392425537},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7738944292068481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7184786796569824},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6580950617790222},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5187206864356995},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5042527914047241},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.496067613363266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4804686903953552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4767744839191437},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4535561203956604},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4183875322341919},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4027680456638336},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.3031395971775055},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19263693690299988}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.9141862392425537},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7738944292068481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7184786796569824},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6580950617790222},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5187206864356995},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5042527914047241},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.496067613363266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4804686903953552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4767744839191437},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4535561203956604},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4183875322341919},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4027680456638336},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.3031395971775055},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19263693690299988},{"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/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/3583668.3594575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583668.3594575","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1976485065","https://openalex.org/W1982792741","https://openalex.org/W1985361054","https://openalex.org/W1992996565","https://openalex.org/W2107805020","https://openalex.org/W2139535340","https://openalex.org/W2488670996","https://openalex.org/W2964107726","https://openalex.org/W3021194740","https://openalex.org/W3045078638","https://openalex.org/W3115907785","https://openalex.org/W3170394705","https://openalex.org/W3184913911","https://openalex.org/W3186734588","https://openalex.org/W4230889046"],"related_works":["https://openalex.org/W2141226803","https://openalex.org/W1972955796","https://openalex.org/W1541857863","https://openalex.org/W2219910205","https://openalex.org/W2978800595","https://openalex.org/W1966768284","https://openalex.org/W207048982","https://openalex.org/W2026651734","https://openalex.org/W2385427787","https://openalex.org/W2070403242"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,6],"any":[3],"one-round":[4],"algorithm":[5],"computes":[7],"a":[8,20,62],"minimum":[9],"spanning":[10],"tree":[11],"(MST)":[12],"in":[13,27,56],"the":[14,28,36,50,57,65,85,94,104,124],"unicast":[15,58,105],"congested":[16,59,106],"clique":[17,60,107],"must":[18],"use":[19],"link":[21],"bandwidth":[22],"of":[23,39,84,96],"\u03a9(log3":[24],"n)":[25,73],"bits":[26],"worst":[29],"case.":[30],"Consequently,":[31],"computing":[32],"an":[33,90],"MST":[34,86],"under":[35],"standard":[37],"assumption":[38],"O(log":[40],"n)-size":[41],"messages":[42],"requires":[43],"at":[44],"least":[45],"2":[46],"rounds.":[47],"This":[48],"is":[49,68,87],"first":[51],"round":[52],"complexity":[53],"lower":[54,76,101],"bound":[55,77],"for":[61,103],"problem":[63],"where":[64],"output":[66,88,113],"size":[67],"small,":[69],"i.e.,":[70],"O(n":[71],"log":[72],"bits.":[74],"Our":[75],"holds":[78],"as":[79,81],"long":[80],"every":[82,120],"edge":[83],"by":[89],"incident":[91],"node.":[92],"To":[93],"best":[95],"our":[97],"knowledge,":[98],"all":[99],"prior":[100],"bounds":[102],"either":[108],"considered":[109],"problems":[110],"with":[111],"large":[112],"sizes":[114],"(e.g.,":[115],"subgraph":[116],"enumeration)":[117],"or":[118],"required":[119],"node":[121],"to":[122],"learn":[123],"entire":[125],"output.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}