{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T01:06:24Z","timestamp":1793063184700,"version":"4.5.0"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1109\/tit.2009.2034824","type":"journal-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T16:40:32Z","timestamp":1262882432000},"page":"438-449","source":"Crossref","is-referenced-by-count":97,"title":["The Communication Complexity of Correlation"],"prefix":"10.1109","volume":"56","author":[{"given":"Prahladh","family":"Harsha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahul","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"McAllester","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595216"},{"key":"ref12","author":"bennett","year":"2006","journal-title":"Personal communication"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568323"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.12"},{"key":"ref15","author":"gallager","year":"1967","journal-title":"Information Theory and Reliable Communication"},{"key":"ref16","first-page":"461","article-title":"communication complexity of remote state preparation with entanglement","volume":"6","author":"jain","year":"2006","journal-title":"Quant Inf Comput"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-49820-1","author":"li","year":"2008","journal-title":"An Introduction to Kolmogorov Complexity and Its Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238196"},{"key":"ref4","first-page":"222","article-title":"probabilistic computations: toward a unified measure of complexity (extended abstract)","author":"yao","year":"1977","journal-title":"Proc IEEE 18th IEEE Symp Found Comput Sci"},{"key":"ref3","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/CCC.2005.24","article-title":"prior entanglement, message compression and privacy in quantum communication","author":"jain","year":"2005","journal-title":"Proc 20th IEEE Conf Comput Complexity"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"ref8","author":"winter","year":"2002","journal-title":"Compression of Sources of Probability Distributions and Density Operators"},{"key":"ref7","first-page":"300","article-title":"a direct sum theorem in communication complexity via message compression","volume":"2719","author":"jain","year":"2003","journal-title":"Proc 30th Int Colloq Automata Languages Programm"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.32"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80059-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref21","author":"bollobs","year":"1986","journal-title":"Combinatorics Set Systems Hypergraphs Families of Vectors and Combinatorial Probability"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5361455\/05361475.pdf?arnumber=5361475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:09Z","timestamp":1633914009000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5361475\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2034824","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}