{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:22:51Z","timestamp":1771485771043,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_42","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"502-513","source":"Crossref","is-referenced-by-count":20,"title":["Public vs Private Coin in Bounded-Round Information"],"prefix":"10.1007","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[]},{"given":"Ankit","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","first-page":"67","volume-title":"Proceedings of the 42nd ACM symposium on Theory of computing, STOC 2010","author":"B. Barak","year":"2010","unstructured":"Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: Proceedings of the 42nd ACM symposium on Theory of computing, STOC 2010, pp. 67\u201376. ACM, New York (2010)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Brody, J., Buhrman, H., Kouck\u1ef3, M., Loff, B., Speelman, F., Vereshchagin, N.: Towards a reverse newman\u2019s theorem in interactive information complexity. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a019, p. 179 (2012)","DOI":"10.1109\/CCC.2013.12"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/2488608.2488628","volume-title":"Proceedings of the 45th Annual ACM Symposium on Theory of Computing","author":"M. Braverman","year":"2013","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 151\u2013160. ACM, Palo Alto (2013)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. In: FOCS, pp. 748\u2013757 (2011)","DOI":"10.1109\/FOCS.2011.86"},{"key":"42_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2213977.2214025"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A., Weinstein, O., Yehudayoff Direct, A.: product via round-preserving compression. ECCC\u00a020(35) (2013)","DOI":"10.1007\/978-3-642-39206-1_20"},{"issue":"4","key":"42_CR7","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z. Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences\u00a068(4), 702\u2013732 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Werner, B. (ed.) Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, October 14-17, pp. 270\u2013278. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959901"},{"key":"42_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York (1991)"},{"key":"42_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":"42_CR11","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters\u00a039(2), 67\u201371 (1991)","journal-title":"Information Processing Letters"},{"key":"42_CR13","unstructured":"Pankratov, D.: Direct sum questions in classical communication complexity. PhD thesis, Masters thesis, University of Chicago (2012)"}],"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-662-43948-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:22:05Z","timestamp":1558909325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}