{"id":"https://openalex.org/W2400545706","doi":"https://doi.org/10.1145/2897518.2897563","title":"Constant-Rate Coding for Multiparty Interactive Communication Is Impossible","display_name":"Constant-Rate Coding for Multiparty Interactive Communication Is Impossible","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2400545706","doi":"https://doi.org/10.1145/2897518.2897563","mag":"2400545706"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897563","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897563&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2897563&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark Braverman","raw_affiliation_strings":["Princeton University, USA","Princeton University, Princeton, NJ USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, NJ USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Klim Efremenko","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]},{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Klim Efremenko","raw_affiliation_strings":["Tel Aviv University, Israel","Ben Gurion university, Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Ben Gurion university, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085059786","display_name":"Ran Gelles","orcid":"https://orcid.org/0000-0003-3615-3239"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Ran Gelles","raw_affiliation_strings":["Princeton University, USA","Bar-Ilan University, Ramat\u00a0Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Bar-Ilan University, Ramat\u00a0Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, USA","Carnegie Mellon University Pittsburgh PA USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University Pittsburgh PA USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042816355"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.2953,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6292339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"65","issue":"1","first_page":"1","last_page":"1010"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6726032495498657},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6316388845443726},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6068889498710632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.551811933517456},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5261133313179016},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5118312239646912},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4962514042854309},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49355804920196533},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.46544039249420166},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4530874490737915},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.43285220861434937},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.430502712726593},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4131700396537781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39834266901016235},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37990128993988037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3588079810142517},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23999112844467163},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14500784873962402},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.11926358938217163}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6726032495498657},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6316388845443726},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6068889498710632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.551811933517456},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5261133313179016},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5118312239646912},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4962514042854309},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49355804920196533},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.46544039249420166},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4530874490737915},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.43285220861434937},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.430502712726593},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4131700396537781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39834266901016235},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37990128993988037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3588079810142517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23999112844467163},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14500784873962402},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.11926358938217163},{"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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2897518.2897563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897563","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897563&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"doi:10.1145/3050218","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3050218","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3050218?download=true","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"mag:2400545706","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc22.html#BravermanEGH15","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/2897518.2897563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897563","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897563&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1558622731","display_name":null,"funder_award_id":"CCF-1149888,CCF-1525342,CCF-1527110,CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2331278181","display_name":null,"funder_award_id":"CCF-1525342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2488755638","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3609167398","display_name":null,"funder_award_id":"257575","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G4062780233","display_name":null,"funder_award_id":"1128155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4104599821","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4478206882","display_name":"AF:  Small:  Noise Across Computational  Settings","funder_award_id":"1525342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226981347","display_name":null,"funder_award_id":"CCF-1149888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5454242832","display_name":"CCF-BSF: AF: Small: Coding for Distributed Computing","funder_award_id":"1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5943845093","display_name":null,"funder_award_id":"1078/17","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7315415636","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7659139977","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8233928647","display_name":null,"funder_award_id":"1149888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8490792168","display_name":null,"funder_award_id":"NSF CCF-1525342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","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/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2400545706.pdf","grobid_xml":"https://content.openalex.org/works/W2400545706.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1963163055","https://openalex.org/W1965555277","https://openalex.org/W1981068980","https://openalex.org/W2012171341","https://openalex.org/W2020278159","https://openalex.org/W2022350090","https://openalex.org/W2026670837","https://openalex.org/W2029315940","https://openalex.org/W2032754226","https://openalex.org/W2037817744","https://openalex.org/W2038082587","https://openalex.org/W2040355376","https://openalex.org/W2043868537","https://openalex.org/W2047805348","https://openalex.org/W2051019379","https://openalex.org/W2053269541","https://openalex.org/W2073276518","https://openalex.org/W2077242989","https://openalex.org/W2115551261","https://openalex.org/W2117696850","https://openalex.org/W2118055209","https://openalex.org/W2123903520","https://openalex.org/W2126420649","https://openalex.org/W2145385126","https://openalex.org/W2171601298","https://openalex.org/W2202879065","https://openalex.org/W2216201412","https://openalex.org/W2296697369","https://openalex.org/W2400545706","https://openalex.org/W2407625463","https://openalex.org/W2419372578","https://openalex.org/W2481902600","https://openalex.org/W2483713254","https://openalex.org/W2749114556","https://openalex.org/W2962994829","https://openalex.org/W2963060525","https://openalex.org/W2963204642","https://openalex.org/W2963520301","https://openalex.org/W2964292074","https://openalex.org/W2978725006","https://openalex.org/W6745967533"],"related_works":["https://openalex.org/W2772918851","https://openalex.org/W2729241879","https://openalex.org/W2963895596","https://openalex.org/W2899626539","https://openalex.org/W2971934427","https://openalex.org/W3007787023","https://openalex.org/W2145385126","https://openalex.org/W3009864067","https://openalex.org/W2952404855","https://openalex.org/W1487579480","https://openalex.org/W2944100454","https://openalex.org/W2578418887","https://openalex.org/W2407991844","https://openalex.org/W1498588823","https://openalex.org/W2951318102","https://openalex.org/W226315685","https://openalex.org/W3103339449","https://openalex.org/W2883554542","https://openalex.org/W1979790324","https://openalex.org/W2031399929"],"abstract_inverted_index":{"We":[0,25,149],"study":[1],"coding":[2,36,157,185,194],"schemes":[3,186],"for":[4,95,190,201],"multiparty":[5],"interactive":[6],"communication":[7,58],"over":[8,63,90],"synchronous":[9,65],"networks":[10,170],"that":[11,30,82,159],"suffer":[12],"from":[13],"stochastic":[14],"noise,":[15],"where":[16],"each":[17],"bit":[18],"is":[19,52,133,171],"independently":[20],"flipped":[21],"with":[22,68,99,154,187,196],"probability":[23,101],"\u03b5.":[24],"analyze":[26],"the":[27,35,44,47,57,91,117,129,134,161,165],"minimal":[28],"overhead":[29],"must":[31,104],"be":[32,84],"added":[33],"by":[34,86],"scheme":[37,158,195],"in":[38,42,74],"order":[39],"to":[40,143],"succeed":[41],"performing":[43],"computation":[45],"despite":[46,182],"noise.":[48],"Our":[49,178],"main":[50],"result":[51,124],"a":[53,64,80,122,144,155],"lower":[54,152],"bound":[55,153],"on":[56,139],"of":[59,102,125,167],"any":[60,97,140],"noise-resilient":[61],"protocol":[62,98],"star":[66,169],"network":[67],"n-parties":[69],"(where":[70],"all":[71],"parties":[72],"communicate":[73,105],"every":[75],"round).":[76],"Specifically,":[77],"we":[78,131],"show":[79],"task":[81],"can":[83,137],"solved":[85],"communicating":[87],"T":[88],"bits":[89,115],"noise-free":[92],"network,":[93],"but":[94],"which":[96],"success":[100],"1-o(1)":[103],"at":[106],"least":[107],"\u03a9(T":[108],"log":[109,112,113,145,146,173,176],"n":[110,147,174],"/":[111,175],"n)":[114],"when":[116],"channels":[118],"are":[119],"noisy.":[120],"By":[121],"1994":[123],"Rajagopalan":[126],"and":[127],"Schulman,":[128],"slowdown":[130],"prove":[132,180],"highest":[135],"one":[136],"obtain":[138],"topology,":[141],"up":[142],"factor.":[148],"complete":[150],"our":[151],"matching":[156],"achieves":[160],"same":[162],"overhead;":[163],"thus,":[164],"capacity":[166],"(synchronous)":[168],"\u0398(log":[172],"n).":[177],"bounds":[179],"that,":[181],"several":[183],"previous":[184],"rate":[188,198],"\u03a9(1)":[189,199],"certain":[191],"topologies,":[192],"no":[193],"constant":[197],"exists":[200],"arbitrary":[202],"n-party":[203],"noisy":[204],"networks.":[205]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}