{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:47Z","timestamp":1740131687680,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"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":[[2017,11]]},"DOI":"10.1109\/tit.2017.2746859","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T14:50:51Z","timestamp":1504104651000},"page":"6979-7002","source":"Crossref","is-referenced-by-count":4,"title":["Information Complexity Density and Simulation of Protocols"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-706X","authenticated-orcid":false,"given":"Himanshu","family":"Tyagi","sequence":"first","affiliation":[]},{"given":"Shaileshh Bojja","family":"Venkatakrishnan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3171-8667","authenticated-orcid":false,"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-8633","authenticated-orcid":false,"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.57210"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808684"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref32","first-page":"155","article-title":"On the redundancy of variable-rate Slepian–Wolf coding","author":"kuzuoka","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0405021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282595"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309140"},{"key":"ref35","first-page":"1063","article-title":"Coding theorems on correlated general sources","volume":"e78 a","author":"miyake","year":"1995","journal-title":"IEICE Trans Fundam"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62265"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.42"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025545"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.27"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12066-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746572"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04268-8_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2567440"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282767"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_21"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284123"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351812"},{"key":"ref55","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"yao","year":"1979","journal-title":"Proc 16 Annual Symp Theory of Comput"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040867"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.85"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214025"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746548"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2002.1115434"},{"key":"ref18","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref19","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Problems Control Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055007"},{"article-title":"Privacy for multi-party protocols","year":"1989","author":"beaver","key":"ref6"},{"key":"ref5","first-page":"481","article-title":"Internal compression of protocols to entropy","volume":"40","author":"bauer","year":"2015","journal-title":"Proc Approx Randomization Comb Optim Algorithms Techn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"article-title":"Common randomness principles of secrecy","year":"2013","author":"tyagi","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.86"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700153"},{"key":"ref47","first-page":"689","article-title":"Asymptotische abschätzungen in Shannon’s informationstheorie","author":"strassen","year":"1962","journal-title":"Proc 3rd Prague Conf Inf Theory"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162226"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707067"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_11"},{"article-title":"Security of quantum key distribution","year":"2005","author":"renner","key":"ref43"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8071168\/08022868.pdf?arnumber=8022868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:40Z","timestamp":1641987580000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8022868\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":57,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2746859","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}