{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:28:30Z","timestamp":1771486110020,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392054","type":"print"},{"value":"9783642392061","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_20","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"232-243","source":"Crossref","is-referenced-by-count":19,"title":["Direct Product via Round-Preserving Compression"],"prefix":"10.1007","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Omri","family":"Weinstein","sequence":"additional","affiliation":[]},{"given":"Amir","family":"Yehudayoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: Proceedings of the 2010 ACM International Symposium on Theory of Computing, pp. 67\u201376 (2010)","DOI":"10.1145\/1806689.1806701"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing. In: FOCS, pp. 477\u2013486 (2008)","DOI":"10.1109\/FOCS.2008.45"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Coding for interactive computation: progress and challenges. In: 50th Annual Allerton Conference on Communication, Control, and Computing (2012)","DOI":"10.1109\/Allerton.2012.6483456"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/2213977.2214025","volume-title":"Proceedings of the 44th Symposium on Theory of Computing, STOC 2012","author":"M. Braverman","year":"2012","unstructured":"Braverman, M.: Interactive information complexity. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 505\u2013524. ACM, New York (2012)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. In: Ostrovsky, R. (ed.) FOCS, pp. 748\u2013757. IEEE (2011)","DOI":"10.1109\/FOCS.2011.86"},{"key":"20_CR6","first-page":"143","volume":"19","author":"M. Braverman","year":"2012","unstructured":"Braverman, M., Rao, A., Weinstein, O., Yehudayoff, A.: Direct products in communication complexity. Electronic Colloquium on Computational Complexity (ECCC)\u00a019, 143 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"20_CR7","first-page":"35","volume":"20","author":"M. Braverman","year":"2013","unstructured":"Braverman, M., Rao, A., Weinstein, O., Yehudayoff, A.: Direct product via round-preserving compression. Electronic Colloquium on Computational Complexity (ECCC)\u00a020, 35 (2013)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"20_CR8","unstructured":"Brody, J., Chakrabarti, A., Kondapally, R.: Certifying equality with limited interaction"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 205\u2013214. ACM (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Harsha, P., Jain, R., McAllester, D.A., Radhakrishnan, J.: The communication complexity of correlation. In: IEEE Conference on Computational Complexity, pp. 10\u201323. IEEE Computer Society (2007)","DOI":"10.1109\/CCC.2007.32"},{"key":"20_CR11","unstructured":"Jain, R.: New strong direct product results in communication complexity"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Jain, R., Pereszlenyi, A., Yao, P.: A direct product theorem for the two-party bounded-round public-coin communication complexity. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 167\u2013176. IEEE (2012)","DOI":"10.1109\/FOCS.2012.42"},{"key":"20_CR13","unstructured":"Jain, R., Yao, P.: A strong direct product theorem in terms of the smooth rectangle bound. CoRR abs\/1209.0263 (2012)"},{"key":"20_CR14","first-page":"38","volume":"19","author":"I. Kerenidis","year":"2012","unstructured":"Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower bounds on information complexity via zero-communication protocols and applications. Electronic Colloquium on Computational Complexity (ECCC)\u00a019, 38 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Klauck, H.: A strong direct product theorem for disjointness. In: STOC, pp. 77\u201386 (2010)","DOI":"10.1145\/1806689.1806702"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A., Spalek, R.: A direct product theorem for discrepancy. In: CCC, pp. 71\u201380 (2008)","DOI":"10.1109\/CCC.2008.25"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A., Spalek, R.: A direct product theorem for discrepancy. In: 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, pp. 71\u201380. IEEE (2008)","DOI":"10.1109\/CCC.2008.25"},{"key":"20_CR18","unstructured":"Molinaro, M., Woodruff, D., Yaroslavtsev, G.: Beating the direct sum theorem in communication complexity with implications for sketching. In: SODA (to appear, 2013)"},{"key":"20_CR19","first-page":"363","volume-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997)","author":"I. Parnafes","year":"1997","unstructured":"Parnafes, I., Raz, R., Wigderson, A.: Direct product results and the GCD problem, in old and new communication models. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), pp. 363\u2013372. Association for Computing Machinery, New York (1997)"},{"issue":"3","key":"20_CR20","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal on Computing\u00a027(3), 763\u2013803 (1998); Prelim version in STOC 1995","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"20_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00037-003-0175-x","volume":"12","author":"R. Shaltiel","year":"2003","unstructured":"Shaltiel, R.: Towards proving strong direct product theorems. Computational Complexity\u00a012(1-2), 1\u201322 (2003); Prelim version CCC 2001","journal-title":"Computational Complexity"},{"issue":"5","key":"20_CR22","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/110842661","volume":"41","author":"A.A. Sherstov","year":"2012","unstructured":"Sherstov, A.A.: Strong direct product theorems for quantum communication and query complexity. SIAM Journal on Computing\u00a041(5), 1122\u20131165 (2012)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4086\/toc.2008.v004a007","volume":"4","author":"E. Viola","year":"2008","unstructured":"Viola, E., Wigderson, A.: Norms, xor lemmas, and lower bounds for polynomials and protocols. Theory of Computing\u00a04(1), 137\u2013168 (2008)","journal-title":"Theory of Computing"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: 18th Annual Symposium on Foundations of Computer Science, pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:29:12Z","timestamp":1557912552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}