{"id":"https://openalex.org/W2152489475","doi":"https://doi.org/10.1109/ccc.2003.1214414","title":"Near-optimal lower bounds on the multi-party communication complexity of set disjointness","display_name":"Near-optimal lower bounds on the multi-party communication complexity of set disjointness","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2152489475","doi":"https://doi.org/10.1109/ccc.2003.1214414","mag":"2152489475"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Chakrabarti","raw_affiliation_strings":["Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"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":false,"raw_author_name":"S. Khot","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101406502","display_name":"Xiaodong Sun","orcid":"https://orcid.org/0000-0003-1637-7593"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaodong Sun","raw_affiliation_strings":["Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":173,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"107","last_page":"117"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.7906374931335449},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7141925692558289},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6529240012168884},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6201088428497314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6053621172904968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.538873016834259},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5086389780044556},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4754350185394287},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.47027283906936646},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4532703757286072},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4479665756225586},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4311320185661316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2425401210784912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22414135932922363},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.144414484500885},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08892562985420227}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7906374931335449},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7141925692558289},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6529240012168884},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6201088428497314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6053621172904968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.538873016834259},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5086389780044556},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4754350185394287},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.47027283906936646},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4532703757286072},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4479665756225586},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4311320185661316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2425401210784912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22414135932922363},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.144414484500885},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08892562985420227},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccc.2003.1214414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.116.2247","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~ac/Pubs/ccc03-disj.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2002501531","https://openalex.org/W2027214648","https://openalex.org/W2054081892","https://openalex.org/W2064379477","https://openalex.org/W2085788081","https://openalex.org/W2088263428","https://openalex.org/W2099111195","https://openalex.org/W2107917944","https://openalex.org/W2114607430","https://openalex.org/W2122929038","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W4243302453"],"related_works":["https://openalex.org/W2003919757","https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2963903795","https://openalex.org/W2008470896","https://openalex.org/W2039347386","https://openalex.org/W4377371889","https://openalex.org/W1673132890","https://openalex.org/W2952190127","https://openalex.org/W3109861677"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,11,40,44,54,62,85,93,104,117,126,140,148,169,181,196,204,236],"communication":[3,41,58,132],"complexity":[4,42,142,159],"of":[5,22,25,34,43,46,88,119,143,162,178,211,239],"set":[7],"disjointness":[8],"problem":[9,45,133],"in":[10,60,68,92,103,116,147],"general":[12,94],"multiparty":[13],"model.":[14,151],"For":[15],"t":[16],"players,":[17],"each":[18],"holding":[19],"a":[20,23,30,69,175,184],"subset":[21],"universe":[24],"size":[26],"n,":[27],"we":[28,72],"establish":[29],"near-optimal":[31],"lower":[32,160],"bound":[33,75,161],"/spl":[35,79,89,97,163,188],"Omega/(n/(t":[36],"log":[37],"t))":[38],"on":[39,203,229],"determining":[47],"whether":[48],"their":[49],"sets":[50],"are":[51,64],"disjoint.":[52],"In":[53],"more":[55],"restrictive":[56],"one-way":[57,105],"model,":[59,95,106],"which":[61],"players":[63],"required":[65],"to":[66,76,108,125,136,155,187,225],"speak":[67],"predetermined":[70],"order,":[71],"improve":[73,83],"our":[74,122],"an":[77,156],"optimal":[78],"Omega/(n/t).":[80],"These":[81],"results":[82,153],"upon":[84],"earlier":[86,120,226],"bounds":[87,123],"Omega/(n/t/sup":[90],"2/)":[91],"and":[96,112,183,231],"Omega/((/spl":[98],"epsiv//sup":[99],"2/n)/t/sup":[100],"1+/spl":[101],"epsiv//)":[102],"due":[107],"Bar-Yossef,":[109],"Jayram,":[110],"Kumar,":[111],"Sivakumar":[113],"(2002).":[114],"As":[115],"case":[118],"results,":[121],"apply":[124],"unique":[127],"intersection":[128],"promise":[129],"problem.":[130],"This":[131],"is":[134,198],"known":[135],"have":[137],"connections":[138],"with":[139,174],"space":[141,158],"approximating":[144,168],"frequency":[145,172],"moments":[146],"data":[149],"stream":[150],"Our":[152,200,216],"lead":[154],"improved":[157],"Omega/(n/sup":[164,189],"1-2/k//log":[165],"n)":[166],"for":[167,234,241],"k/sup":[170],"th/":[171],"moment":[173],"constant":[176],"number":[177],"passes":[179],"over":[180,195],"input,":[182],"technical":[185],"improvement":[186],"1-2/k/)":[190],"if":[191],"only":[192],"one":[193],"pass":[194],"input":[197],"permitted.":[199],"proofs":[201],"rely":[202],"information":[205,237],"theoretic":[206],"direct":[207],"sum":[208],"decomposition":[209],"paradigm":[210],"Bar-Yossef":[212],"et":[213],"al.":[214],"[2002].":[215],"improvements":[217],"stem":[218],"from":[219],"novel":[220],"analytical":[221],"techniques,":[222],"as":[223],"opposed":[224],"techniques":[227],"based":[228],"Hellinger":[230],"related":[232],"distances,":[233],"estimating":[235],"cost":[238],"protocols":[240],"one-bit":[242],"functions.":[243]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}