{"id":"https://openalex.org/W1992996565","doi":"https://doi.org/10.1145/2767386.2767434","title":"Toward Optimal Bounds in the Congested Clique","display_name":"Toward Optimal Bounds in the Congested Clique","publication_year":2015,"publication_date":"2015-07-17","ids":{"openalex":"https://openalex.org/W1992996565","doi":"https://doi.org/10.1145/2767386.2767434","mag":"1992996565"},"language":"en","primary_location":{"id":"doi:10.1145/2767386.2767434","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2767386.2767434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 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/A5071267353","display_name":"James W. Hegeman","orcid":null},"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":"James W. Hegeman","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, 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, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, 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":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039910209","display_name":"Vivek B. Sardeshmukh","orcid":"https://orcid.org/0000-0002-1722-0486"},"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":"Vivek B. Sardeshmukh","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072734392","display_name":"Michele Scquizzato","orcid":"https://orcid.org/0000-0002-9108-2448"},"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":"Michele Scquizzato","raw_affiliation_strings":["University of Houston, Houston, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5071267353"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":17.5258,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.99466192,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"100"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/clique","display_name":"Clique","score":0.5887039303779602},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5558821558952332},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5143983960151672},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5122296214103699},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4916909337043762},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.47918498516082764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47291335463523865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45570075511932373},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4475836157798767},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4348203241825104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4276805520057678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41623786091804504}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5887039303779602},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5558821558952332},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5143983960151672},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5122296214103699},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4916909337043762},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.47918498516082764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47291335463523865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45570075511932373},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4475836157798767},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4348203241825104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4276805520057678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41623786091804504},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2767386.2767434","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2767386.2767434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3298669","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3298669","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6889964609","display_name":null,"funder_award_id":"CCF-1318166","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1511278436","https://openalex.org/W1515635142","https://openalex.org/W1568961751","https://openalex.org/W1592346261","https://openalex.org/W1816797629","https://openalex.org/W1845051857","https://openalex.org/W1866858131","https://openalex.org/W1945584931","https://openalex.org/W1976485065","https://openalex.org/W1987099434","https://openalex.org/W1997010704","https://openalex.org/W2016289973","https://openalex.org/W2035994564","https://openalex.org/W2040011014","https://openalex.org/W2045760791","https://openalex.org/W2056695987","https://openalex.org/W2084867968","https://openalex.org/W2088374619","https://openalex.org/W2107805020","https://openalex.org/W2138304862","https://openalex.org/W2139535340","https://openalex.org/W2144146806","https://openalex.org/W2149067844","https://openalex.org/W2156396224","https://openalex.org/W2174199856","https://openalex.org/W2245672739","https://openalex.org/W2295428206","https://openalex.org/W2344116943","https://openalex.org/W2347145740","https://openalex.org/W2395489635","https://openalex.org/W2570634592","https://openalex.org/W2950813619","https://openalex.org/W2951272922"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W1541068124","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2007715402","https://openalex.org/W1525123833","https://openalex.org/W2475816962","https://openalex.org/W2004524662","https://openalex.org/W2962985337","https://openalex.org/W2899261484"],"abstract_inverted_index":{"We":[0,68],"study":[1],"two":[2],"fundamental":[3],"graph":[4,137],"problems,":[5],"Graph":[6],"Connectivity":[7],"(GC)":[8],"and":[9,20,28,141],"Minimum":[10],"Spanning":[11],"Tree":[12],"(MST),":[13],"in":[14,52,86],"the":[15,26,49,95,98,108],"well-studied":[16],"Congested":[17],"Clique":[18],"model,":[19],"present":[21],"several":[22,133],"new":[23],"bounds":[24,43],"on":[25,107],"time":[27,41,111],"message":[29],"complexities":[30],"of":[31,48,97,113,132],"randomized":[32,77],"algorithms":[33,63,80,129],"for":[34,46,65,81,118],"these":[35,66,119],"problems.":[36,67],"No":[37],"non-trivial":[38],"(i.e.,":[39],"super-constant)":[40],"lower":[42],"are":[44],"known":[45],"either":[47],"aforementioned":[50],"problems;":[51],"particular,":[53],"an":[54,104],"important":[55],"open":[56],"question":[57,74],"is":[58,94],"whether":[59],"or":[60],"not":[61],"constant-round":[62],"exist":[64],"make":[69,130],"progress":[70],"toward":[71],"answering":[72],"this":[73],"by":[75,103],"presenting":[76],"Monte":[78],"Carlo":[79],"both":[82],"problems":[83,120],"that":[84],"run":[85],"O(log":[87,114],"log":[88,89,115],"n)":[90,116],"rounds":[91,117],"(where":[92],"n":[93],"size":[96],"clique).":[99],"Our":[100,128],"results":[101],"improve":[102],"exponential":[105],"factor":[106],"long-standing":[109],"(deterministic)":[110],"bound":[112],"due":[121],"to":[122],"Lotker":[123],"et":[124],"al.":[125],"(SICOMP":[126],"2005).":[127],"use":[131],"algorithmic":[134],"tools":[135],"including":[136],"sketching,":[138],"random":[139],"sampling,":[140],"fast":[142],"sorting.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}