{"id":"https://openalex.org/W4390471865","doi":"https://doi.org/10.4086/toc.2023.v019a010","title":"","display_name":"","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4390471865","doi":"https://doi.org/10.4086/toc.2023.v019a010"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2023.v019a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a010","pdf_url":"https://theoryofcomputing.org/articles/v019a010/v019a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v019a010/v019a010.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036788830","display_name":"Elbert Du","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elbert Du","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Woodruff","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100616292","display_name":"Guang Yang","orcid":"https://orcid.org/0000-0002-2991-9737"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guang Yang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036788830"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25994889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"44"},"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.9995999932289124,"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.9995999932289124,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9968000054359436,"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/T10237","display_name":"Cryptography and Data Security","score":0.9965999722480774,"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/turnstile","display_name":"Turnstile","score":0.6956789493560791},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6795974373817444},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6252222657203674},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6251322031021118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5347883105278015},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5032805800437927},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4670298099517822},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4635668694972992},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.46227723360061646},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44719812273979187},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4466811418533325},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4122445285320282},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40420907735824585},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.25272953510284424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14308524131774902},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10310781002044678}],"concepts":[{"id":"https://openalex.org/C31370731","wikidata":"https://www.wikidata.org/wiki/Q7856108","display_name":"Turnstile","level":2,"score":0.6956789493560791},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6795974373817444},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6252222657203674},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6251322031021118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5347883105278015},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5032805800437927},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4670298099517822},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4635668694972992},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.46227723360061646},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44719812273979187},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4466811418533325},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4122445285320282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40420907735824585},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.25272953510284424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14308524131774902},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10310781002044678},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2023.v019a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a010","pdf_url":"https://theoryofcomputing.org/articles/v019a010/v019a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2023.v019a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a010","pdf_url":"https://theoryofcomputing.org/articles/v019a010/v019a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G103129866","display_name":null,"funder_award_id":"CNS-2107078","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1362880884","display_name":null,"funder_award_id":"DMS-2023528","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1576755235","display_name":"Foundations of Data Science Institute","funder_award_id":"2023528","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4412136430","display_name":"AF: Small: Algorithms and Data Structures with Predictions","funder_award_id":"2101140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4598397689","display_name":null,"funder_award_id":"2107078","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5619652333","display_name":null,"funder_award_id":"CCF-2101140","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/F4320309622","display_name":"Harvard University","ror":"https://ror.org/03vek6s52"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4390471865.pdf"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W2027214648","https://openalex.org/W2540367636","https://openalex.org/W4226347946"],"related_works":["https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W4295576077","https://openalex.org/W2963366490","https://openalex.org/W2791481841","https://openalex.org/W2963903795","https://openalex.org/W2008470896","https://openalex.org/W4377371889","https://openalex.org/W3119911731","https://openalex.org/W1673132890"],"abstract_inverted_index":{"$":[0,5],"\\newcommand{\\ensuremath}[1]{#1}":[1],"\\newcommand{\\poly}{\\mathsf{poly}}":[2],"\\newcommand{\\polylog}{\\ensuremath{\\mathsf{polylog}}}":[3],"\\newcommand{\\gap}{\\ensuremath{\\varepsilon}}":[4],"In":[6,146],"a":[7,23,53,194,217,287],"$k$-party":[8],"communication":[9,32,63,75],"problem,":[10],"the":[11,37,42,73,78,84,101,126,161,166,201,210,227,245,253,260,270,290,294,297],"$k$":[12],"players":[13,58,80],"with":[14,188,221],"inputs":[15,43],"$x_1,":[16],"x_2,":[17,26],"\\ldots,":[18,27],"x_k$":[19],"want":[20],"to":[21,216],"evaluate":[22],"function":[24],"$f(x_1,":[25],"x_k)$":[28],"using":[29],"as":[30,33],"little":[31],"possible.":[34],"We":[35,94,119,198],"consider":[36],"message-passing":[38],"model,":[39,103],"in":[40,46,100,138,193,293],"which":[41,111],"are":[44,112],"partitioned":[45],"an":[47,150,173,273],"arbitrary,":[48],"possibly":[49],"worst-case":[50],"manner,":[51],"among":[52],"smaller":[54,71,90],"number":[55,167],"$t$":[56,79],"of":[57,65,134,156,164,169,172,182,255,283,289,296],"($t<":[59],"k$).":[60],"The":[61],"$t$-player":[62],"cost":[64],"computing":[66],"$f$":[67],"can":[68,81,91],"only":[69],"be":[70],"than":[72],"$k$-player":[74,85],"cost,":[76],"since":[77,269],"trivially":[82],"simulate":[83],"protocol.":[86],"But":[87],"how":[88],"much":[89,122],"it":[92],"be?":[93],"study":[95],"deterministic":[96],"and":[97,104,187,235,251,304],"randomized":[98],"protocols":[99],"one-way":[102],"provide":[105,121],"separations":[106,124],"for":[107,114,142,160,209,263],"product":[108],"input":[109,127],"distributions,":[110],"optimal":[113,151],"low":[115],"error":[116],"probability":[117,190],"protocols.":[118],"also":[120,242],"stronger":[123],"when":[125,212,232,236],"distribution":[128],"is":[129,137],"non-product.":[130],"A":[131,280],"key":[132],"application":[133],"our":[135],"results":[136,225],"proving":[139],"lower":[140,158,207,249],"bounds":[141,231],"data":[143],"stream":[144],"algorithms.":[145],"particular,":[147],"we":[148,213],"give":[149],"$\\Omega(\\gap^{-2}\\log(N)":[152,203],"\\log":[153,204],"\\log(mM))$":[154],"bits":[155],"space":[157,206],"bound":[159,208,250],"fundamental":[162],"problem":[163,211],"$(1\\pm\\gap)$-approximating":[165],"$\\|x\\|_0$":[168],"non-zero":[170],"entries":[171],"$n$-dimensional":[174],"vector":[175],"$x$":[176],"after":[177],"$m$":[178],"integer":[179],"updates":[180],"each":[181],"magnitude":[183],"at":[184],"most":[185],"$M$,":[186],"success":[189],"$\\ge":[191],"2/3$,":[192],"strict":[195],"turnstile":[196],"stream.":[197],"additionally":[199],"prove":[200],"matching":[202],"\\log(T))$":[205],"have":[214],"access":[215],"heavy":[218],"hitters":[219],"oracle":[220],"threshold":[222],"$T$.":[223],"Our":[224],"match":[226],"best":[228],"known":[229],"upper":[230,277],"$\\gap\\ge":[233],"1/\\polylog(mM)$":[234],"$T":[237],"=":[238],"2^{\\poly(1/\\epsilon)}$,":[239],"respectively.":[240],"It":[241],"improves":[243],"on":[244,301],"prior":[246],"$\\Omega(\\gap^{-2}\\log(mM)":[247],")$":[248],"separates":[252],"complexity":[254],"approximating":[256,259],"$L_0$":[257],"from":[258,267],"$p$-norm":[261],"$L_p$":[262],"$p$":[264],"bounded":[265],"away":[266],"$0$,":[268],"latter":[271],"has":[272],"$O(\\gap^{-2}\\log":[274],"(mM))$":[275],"bit":[276],"bound.":[278],"--------------------------":[279],"preliminary":[281],"version":[282],"this":[284],"paper,":[285],"by":[286],"subset":[288],"authors,":[291],"appeared":[292],"Proceedings":[295],"46th":[298],"International":[299],"Colloquium":[300],"Automata,":[302],"Languages":[303],"Programming,":[305],"2019":[306],"(ICALP'19).":[307]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2024-01-01T00:00:00"}