{"id":"https://openalex.org/W3170407035","doi":"https://doi.org/10.1145/3406325.3451106","title":"The communication complexity of multiparty set disjointness under product distributions","display_name":"The communication complexity of multiparty set disjointness under product distributions","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3170407035","doi":"https://doi.org/10.1145/3406325.3451106","mag":"3170407035"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of 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/A5039993352","display_name":"Nachum Dershowitz","orcid":"https://orcid.org/0000-0003-0363-2735"},"institutions":[{"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":true,"raw_author_name":"Nachum Dershowitz","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[{"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":"Rotem Oshman","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022551817","display_name":"Tal Roth","orcid":"https://orcid.org/0009-0000-7094-8348"},"institutions":[{"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":"Tal Roth","raw_affiliation_strings":["Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039993352"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.2959,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6002786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1194","last_page":"1207"},"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9912999868392944,"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/set","display_name":"Set (abstract data type)","score":0.7210025191307068},{"id":"https://openalex.org/keywords/blackboard","display_name":"Blackboard (design pattern)","score":0.6628919243812561},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6161408424377441},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6075608730316162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5992236137390137},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5810247659683228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.465465784072876},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.416761189699173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4116477966308594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38328438997268677},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33050113916397095}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.7210025191307068},{"id":"https://openalex.org/C2778308757","wikidata":"https://www.wikidata.org/wiki/Q23601418","display_name":"Blackboard (design pattern)","level":2,"score":0.6628919243812561},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6161408424377441},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6075608730316162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5992236137390137},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5810247659683228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.465465784072876},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.416761189699173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4116477966308594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38328438997268677},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33050113916397095},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4300000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1512493349","https://openalex.org/W1599370812","https://openalex.org/W1980223785","https://openalex.org/W2045131847","https://openalex.org/W2080745194","https://openalex.org/W2085382249","https://openalex.org/W2095409339","https://openalex.org/W2107917944","https://openalex.org/W2108884089","https://openalex.org/W2114607430","https://openalex.org/W2120210041","https://openalex.org/W2167099561","https://openalex.org/W2169422095","https://openalex.org/W2770410858","https://openalex.org/W2950116678","https://openalex.org/W2952343177","https://openalex.org/W2952729069","https://openalex.org/W2966695329","https://openalex.org/W3007079226","https://openalex.org/W4211154544","https://openalex.org/W6729804702"],"related_works":["https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W4288641573","https://openalex.org/W2328371232","https://openalex.org/W1481287275","https://openalex.org/W2940671439","https://openalex.org/W1501319629","https://openalex.org/W4301871063"],"abstract_inverted_index":{"In":[0],"the":[1,33,51,65,74,87,99,115,120,127,132,146,158,173,178],"multiparty":[2,78],"number-in-hand":[3],"set":[4,39,79],"disjointness":[5,40,80],"problem,":[6],"we":[7],"have":[8],"k":[9,150],"players,":[10],"with":[11],"private":[12],"inputs":[13,67,139,156],"X1,\u2026,Xk":[14],"\u2286":[15],"[n].":[16],"The":[17],"players\u2019":[18,66],"goal":[19],"is":[20,29,94,105,151],"to":[21,96,184],"check":[22],"whether":[23,86],"\u2229\u2113=1k":[24],"X\u2113":[25],"=":[26],"\u2205.":[27],"It":[28],"known":[30,95],"that":[31,64,125],"in":[32,50,98,126,145],"shared":[34,116,128],"blackboard":[35,117,129],"model":[36,118],"of":[37,47,77,109,134],"communication,":[38,48],"requires":[41,55],"\u03a9(n":[42],"logk":[43],"+":[44,111],"k)":[45,112],"bits":[46],"and":[49,84,119,142,165],"coordinator":[52,121,147],"model,":[53,130,148],"it":[54,93],"\u03a9(kn)":[56],"bits.":[57],"However,":[58],"these":[59],"two":[60,187],"lower":[61,167],"bounds":[62,168],"require":[63],"can":[68],"be":[69],"highly":[70],"correlated.":[71],"We":[72],"study":[73],"communication":[75],"complexity":[76],"under":[81],"product":[82],"distributions,":[83],"ask":[85],"problem":[88,159],"becomes":[89],"significantly":[90],"easier,":[91],"as":[92,131,172],"become":[97],"two-party":[100,179],"case.":[101],"Our":[102],"main":[103],"result":[104],"a":[106],"nearly-tight":[107],"bound":[108],"\u0398\u0303(n1\u22121/k":[110],"for":[113,177],"both":[114],"model.":[122],"This":[123],"shows":[124],"number":[133],"players":[135],"grows,":[136],"having":[137,154],"independent":[138,155],"helps":[140],"less":[141],"less;":[143],"but":[144],"when":[149],"very":[152],"large,":[153],"makes":[157],"much":[160],"easier.":[161],"Both":[162],"our":[163,166],"upper":[164],"use":[169],"new":[170],"ideas,":[171],"original":[174],"techniques":[175],"developed":[176],"case":[180],"do":[181],"not":[182],"scale":[183],"more":[185],"than":[186],"players.":[188]},"counts_by_year":[{"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"}