{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:06:04Z","timestamp":1729616764439,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/ccc.2012.41","type":"proceedings-article","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T16:43:30Z","timestamp":1343753010000},"page":"136-136","source":"Crossref","is-referenced-by-count":0,"title":["Communication Complexity and Information Complexity: Foundations and New Directions"],"prefix":"10.1109","author":[{"given":"Toniann","family":"Pitassi","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45061-0_26","article-title":"A direct sum theorem in communication complexity via message compression","volume":"2719","author":"jain","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806703"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"7","article-title":"Differentially Private Communication Complexity","author":"mcgregor","year":"0","journal-title":"Proceedings IEEE Foundations of Computer Science 2010"},{"key":"6","article-title":"Pan Private Streaming Algorithms","author":"dwork","year":"0","journal-title":"Proceedings Innovations in Computer Science (ICS) 2010"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.32"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.24"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807369"},{"key":"11","article-title":"On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Tradeoffs in Proof Complexity","author":"huynh","year":"0","journal-title":"Proceedings ACM Symposium on Theory of Computing 2012"}],"event":{"name":"2012 IEEE Conference on Computational Complexity (CCC)","start":{"date-parts":[[2012,6,26]]},"location":"Porto, Portugal","end":{"date-parts":[[2012,6,29]]}},"container-title":["2012 IEEE 27th Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6242817\/6243364\/06243389.pdf?arnumber=6243389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:15:39Z","timestamp":1497982539000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6243389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/ccc.2012.41","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}