{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:40:47Z","timestamp":1729647647688,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2005.1","type":"proceedings-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T18:42:50Z","timestamp":1119984170000},"page":"52-66","source":"Crossref","is-referenced-by-count":9,"title":["A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness"],"prefix":"10.1109","author":[{"given":"P.","family":"Beame","sequence":"first","affiliation":[]},{"given":"T.","family":"Pitassi","sequence":"additional","affiliation":[]},{"given":"N.","family":"Segerlind","sequence":"additional","affiliation":[]},{"given":"A.","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1007\/BF01206317"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1137\/0405044"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/SCT.1992.215401"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/SCT.1994.315814"},{"key":"16","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45061-0_26","article-title":"A direct sum theorem in communication complexity via message compression","volume":"2719","author":"jain","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1137\/0406009"},{"key":"14","article-title":"On Yao's XOR-lemma","volume":"tr95 50","author":"goldreich","year":"1995","journal-title":"Technical Report"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/SFCS.2001.959901"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/800061.808737"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1109\/FOCS.2004.52"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1109\/CCC.2003.1214415"},{"year":"1997","author":"kushilevitz","journal-title":"Communication Complexity","key":"22"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1137\/S0097539795282444"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1137\/0222016"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1137\/S0097539795280895"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1007\/PL00001602"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1145\/146637.146684"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1016\/0304-3975(92)90260-M"},{"doi-asserted-by":"publisher","key":"29","DOI":"10.1145\/509907.509963"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1137\/S0097539700375944"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/SFCS.1986.15"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/CCC.2003.1214414"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1006\/jcss.1997.1545"},{"key":"30","first-page":"107","article-title":"Towards proving strong direct product theorems","author":"shaltiel","year":"2001","journal-title":"Proceedings Sixteenth Annual IEEE Conference on Computational Complexity"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/j.jcss.2003.11.006"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/CCC.2002.1004344"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1016\/0022-0000(92)90047-M"},{"key":"4","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s004930100009","article-title":"The cost of the missing bit: Communication complexity with help","volume":"21","author":"babai","year":"2001","journal-title":"COMBINATORICA"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1016\/0020-0190(90)90101-3"},{"key":"8","article-title":"Polynomial threshold proofs and multiparty communication complexity","author":"beame","year":"2005","journal-title":"ICALP"}],"event":{"name":"20th Annual IEEE Conference on Computational Complexity (CCC'05)","location":"San Jose, CA, USA"},"container-title":["20th Annual IEEE Conference on Computational Complexity (CCC'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9851\/31036\/01443073.pdf?arnumber=1443073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T20:46:00Z","timestamp":1497645960000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1443073\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/ccc.2005.1","relation":{},"subject":[]}}