{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:30Z","timestamp":1740109410091,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T00:00:00Z","timestamp":1483747200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Russian Foundation for Basic Research (RU)","award":["16-01-00362"],"award-info":[{"award-number":["16-01-00362"]}]},{"name":"President's of Russian Federation grant","award":["MK-7312.2016.1"],"award-info":[{"award-number":["MK-7312.2016.1"]}]},{"name":"Russian Academic Excellence Project","award":["'5-100'"],"award-info":[{"award-number":["'5-100'"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00224-016-9741-x","type":"journal-article","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T03:53:11Z","timestamp":1483761191000},"page":"583-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Slepian\u2013Wolf Theorem with Interaction"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9956-9023","authenticated-orcid":false,"given":"Alexander","family":"Kozachinskiy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"9741_CR1","unstructured":"Bauer, B., Moran, S., Yehudayoff, A.: Internal compression of protocols to entropy. Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques, p. 481 (2015)"},{"key":"9741_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, M., Garg, A.: Public vs private coin in bounded-round information. In: Automata, Languages, and Programming, pp. 502\u2013513. Springer (2014)","DOI":"10.1007\/978-3-662-43948-7_42"},{"key":"9741_CR3","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), 2011 , IEEE, pp. 748\u2013757 (2011)","DOI":"10.1109\/FOCS.2011.86"},{"key":"9741_CR4","doi-asserted-by":"crossref","unstructured":"Brody, J., Buhrman, H., Koucky, M., Loff, B., Speelman, F., Vereshchagin, N.: Towards a reverse Newman\u2019s theorem in interactive information complexity. In: IEEE Conference on Computational Complexity (CCC), 2013, IEEE, pp. 24\u201333 (2013)","DOI":"10.1109\/CCC.2013.12"},{"key":"9741_CR5","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (2006)"},{"issue":"2","key":"9741_CR6","doi-asserted-by":"crossref","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. Inf. Process. Lett. 39(2), 67\u201371 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"9741_CR7","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1109\/18.149503","volume":"38","author":"A Orlitsky","year":"1992","unstructured":"Orlitsky, A.: Average-case interactive communication. IEEE Trans. Inf. Theory 38(5), 1534\u20131547 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9741_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"4","key":"9741_CR9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inf. Theory 19(4), 471\u2013480 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9741_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/2789149.2789161","volume":"46","author":"O Weinstein","year":"2015","unstructured":"Weinstein, O.: Information complexity and the quest for interactive compression. ACM SIGACT News 46(2), 41\u201364 (2015)","journal-title":"ACM SIGACT News"},{"key":"9741_CR11","unstructured":"Yeung, R.W.: Information Theory and Network Coding. Springer (2008)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9741-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9741-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9741-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,13]],"date-time":"2018-03-13T20:26:36Z","timestamp":1520972796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9741-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9741"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9741-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,1,7]]}}}