{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:19:00Z","timestamp":1774678740952,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_26","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"300-315","source":"Crossref","is-referenced-by-count":37,"title":["A Direct Sum Theorem in Communication Complexity via Message Compression"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranab","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and J. Spencer. The probabilistic method. John Wiley and Sons, 2000.","DOI":"10.1002\/0471722154"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Z. Bar-Yossef, T. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 209\u2013218, 2002.","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti, Y. Shi, A. Wirth, and A. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 33st Annual ACM Symposium on Theory of Computing, 2001.","DOI":"10.1109\/SFCS.2001.959901"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"T. Feder, E. Kushilevitz, M. Naor, and N. Nisan. Amortized communication complexity. In SIAM Journal of Computing, pages 239\u2013248, 1995.","DOI":"10.1137\/S0097539792235864"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"R. Jain, J. Radhakrishnan, and P. Sen. Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 429\u2013438, 2002.","DOI":"10.1109\/SFCS.2002.1181967"},{"key":"26_CR6","unstructured":"R. Jain, J. Radhakrishnan, and P Sen. A lower bound for bounded round quantum communication complexity of set disjointness function. Manuscript at quant-ph\/0303138, 2003."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"M. Karchmer, E. Kushilevitz, and N. Nisan. Fractional covers and communication complexity. In Structures in Complexity Theory\u2019 92, pages 262\u2013274, 1992.","DOI":"10.1109\/SCT.1992.215401"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N. Nisan","year":"1993","unstructured":"N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal of Computing, 22:211\u2013219, 1993.","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jcss.2000.1731","volume":"62","author":"S. Ponzio","year":"2001","unstructured":"S. Ponzio, J. Radhakrishnan, and S. Venkatesh. The communication complexity of pointer chasing. Journal of Computer and System Sciences, 62(2):323\u2013355, 2001.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR11","unstructured":"S. Ross. Simulation. Academic Press, 1997."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"A.C-C. Yao. Some complexity questions related to distributed computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pages 209\u2013213, 1979.","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:14:38Z","timestamp":1556666078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}