{"id":"https://openalex.org/W2403908979","doi":"https://doi.org/10.1137/120891587","title":"The Multiparty Communication Complexity of Set Disjointness","display_name":"The Multiparty Communication Complexity of Set Disjointness","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2403908979","doi":"https://doi.org/10.1137/120891587","mag":"2403908979"},"language":"en","primary_location":{"id":"doi:10.1137/120891587","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120891587","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5079755716","display_name":"Alexander A. Sherstov","orcid":"https://orcid.org/0000-0002-2488-7852"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander A. Sherstov","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079755716"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65429627,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"45","issue":"4","first_page":"1450","last_page":"1489"},"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.9911999702453613,"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.9911999702453613,"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.9818999767303467,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9369000196456909,"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/omega","display_name":"Omega","score":0.7140975594520569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7006282210350037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6718430519104004},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6574497222900391},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6310306787490845},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5393556952476501},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4632256031036377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4608577787876129},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.45361095666885376},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4222826659679413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15726876258850098},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13739845156669617},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10951215028762817}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7140975594520569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7006282210350037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6718430519104004},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6574497222900391},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6310306787490845},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5393556952476501},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4632256031036377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4608577787876129},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.45361095666885376},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4222826659679413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15726876258850098},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13739845156669617},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10951215028762817},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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":2,"locations":[{"id":"doi:10.1137/120891587","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120891587","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"mag:2403908979","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc18.html#Sherstov11b","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W7548172","https://openalex.org/W1969865855","https://openalex.org/W1972068724","https://openalex.org/W1973728061","https://openalex.org/W1980223785","https://openalex.org/W1989966214","https://openalex.org/W1992641578","https://openalex.org/W1999474022","https://openalex.org/W2010501977","https://openalex.org/W2012496360","https://openalex.org/W2027328186","https://openalex.org/W2036908068","https://openalex.org/W2041210515","https://openalex.org/W2062223744","https://openalex.org/W2070486524","https://openalex.org/W2074564146","https://openalex.org/W2076448565","https://openalex.org/W2077740213","https://openalex.org/W2107917944","https://openalex.org/W2107998050","https://openalex.org/W2122780600","https://openalex.org/W2148211896","https://openalex.org/W2148957455","https://openalex.org/W2151303208","https://openalex.org/W2172507717","https://openalex.org/W2320692600","https://openalex.org/W2611355853","https://openalex.org/W2963914453","https://openalex.org/W4256261794"],"related_works":["https://openalex.org/W2044859592","https://openalex.org/W1823715352","https://openalex.org/W1513451900","https://openalex.org/W2963903795","https://openalex.org/W2172507717","https://openalex.org/W2951685119","https://openalex.org/W2402254081","https://openalex.org/W2103587345","https://openalex.org/W2249023948","https://openalex.org/W358628003","https://openalex.org/W2015924804","https://openalex.org/W1569763258","https://openalex.org/W2272066300","https://openalex.org/W3186935454","https://openalex.org/W3105094916","https://openalex.org/W2951436726","https://openalex.org/W1872088823","https://openalex.org/W2952690599","https://openalex.org/W2568405002","https://openalex.org/W2951592515"],"abstract_inverted_index":{"In":[0],"the":[1,6,23,29,34,47,99],"$k$-party":[2],"set":[3,64,81,106],"disjointness":[4,65,82],"problem,":[5],"goal":[7],"is":[8,56,139],"to":[9,58,89,95,113,133,143,151],"determine":[10],"whether":[11],"given":[12],"subsets":[13],"$S_1,S_2,\\dots,S_k\\subseteq\\{1,2,\\dots,n\\}$":[14],"have":[15],"empty":[16],"intersection.":[17],"We":[18,73],"study":[19],"this":[20],"problem":[21,111,149],"in":[22],"number-on-the-forehead":[24],"model":[25],"of":[26,44,80,86,124],"communication,":[27,87],"where":[28],"$i$th":[30],"party":[31],"knows":[32],"all":[33],"sets":[35],"except":[36],"for":[37,63,104,131],"$S_i,$":[38],"and":[39,49,145,153],"prove":[40,75],"a":[41,121,159],"lower":[42,54,61],"bound":[43,55],"$\\Omega(n/4^k)^{1/4}$":[45],"on":[46],"randomized":[48],"nondeterministic":[50],"communication":[51],"complexity.":[52],"This":[53,97,137],"close":[57,94],"tight.":[59],"Previous":[60],"bounds":[62],"with":[66,127,141],"$k\\geq3$":[67],"parties":[68],"were":[69],"weaker":[70],"than":[71],"$\\Omega(n/2^{k^3})^{1/(k+1)}.$":[72],"also":[74],"that":[76],"solving":[77,108],"$\\ell$":[78],"instances":[79],"requires":[83],"$\\ell\\cdot\\Omega(n/4^k)^{1/4}$":[84],"bits":[85],"even":[88],"achieve":[90],"correctness":[91],"probability":[92],"exponentially":[93,128],"$1/2.$":[96],"gives":[98],"first":[100],"direct":[101],"product":[102],"result":[103,138],"multiparty":[105],"disjointness,":[107],"an":[109,147],"open":[110,148],"due":[112,150],"Beame":[114,152],"et":[115],"al.":[116],"(2005).":[117],"Finally,":[118],"we":[119],"construct":[120],"read-once":[122],"$\\{\\wedge,\\vee\\}$-circuit":[123],"depth":[125,144],"$3$":[126],"small":[129],"discrepancy":[130],"up":[132],"$k\\approx\\frac12\\log":[134],"n$":[135],"parties.":[136],"optimal":[140],"respect":[142],"solves":[146],"Huynh-Ngoc":[154],"(FOCS":[155],"'09),":[156],"who":[157],"gave":[158],"depth-$6$":[160],"construction.":[161]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}