{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:16:30Z","timestamp":1778807790048,"version":"3.51.4"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214414","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T14:34:28Z","timestamp":1079966068000},"page":"107-117","source":"Crossref","is-referenced-by-count":76,"title":["Near-optimal lower bounds on the multi-party communication complexity of set disjointness"],"prefix":"10.1109","author":[{"given":"A.","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Khot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xiaodong Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509963"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509964"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00157-3"},{"key":"10","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029945"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892082"},{"key":"8","author":"ha?stad","year":"1990","journal-title":"The Probabilistic Communication Complexity of Disjointness of K-sets Is O(k)"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark","acronym":"CCC-03"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214414.pdf?arnumber=1214414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T18:47:59Z","timestamp":1489430879000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214414\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214414","relation":{},"subject":[]}}