{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:19:11Z","timestamp":1761293951026,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation CAREER award","award":["CCF-12-53205"],"award-info":[{"award-number":["CCF-12-53205"]}]},{"name":"The Center for Science of Information","award":["CCF-09-39370"],"award-info":[{"award-number":["CCF-09-39370"]}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["639573"],"award-info":[{"award-number":["639573"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Israeli Science Foundation","award":["1367\/14"],"award-info":[{"award-number":["1367\/14"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316332","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"792-803","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Communication complexity of estimating correlations"],"prefix":"10.1145","author":[{"given":"Uri","family":"Hadar","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingbo","family":"Liu","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yury","family":"Polyanskiy","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347496"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995937"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806701"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734103"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/120861072"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875561"},{"key":"e_1_3_2_1_10_1","unstructured":"{DN04} \n      \n      Herbert A.\n       \n      David\n     and \n      \n      \n      Haikady N.\n       \n      Nagaraja\n      \n  \n  . \n  Order Statistics\n  . \n  Wiley Series in Probability and Statistics\n  . \n  Wiley 2004\n  .  {DN04} Herbert A. David and Haikady N. Nagaraja. Order Statistics. Wiley Series in Probability and Statistics. Wiley 2004."},{"key":"e_1_3_2_1_11_1","unstructured":"{Gar18} Ankit Garg. Private communications. 2018.  {Gar18} Ankit Garg. Private communications. 2018."},{"key":"e_1_3_2_1_12_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"50","author":"Guruswami Venkatesan","year":"2016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720540"},{"key":"e_1_3_2_1_14_1","unstructured":"{H\u00d6W18} Yanjun Han Ayfer \u00d6zg\u00fcr and Tsachy Weissman. Geometric lower bounds for distributed parameter estimation under communication constraints. arXiv preprint arXiv:1802.08417 2018.  {H\u00d6W18} Yanjun Han Ayfer \u00d6zg\u00fcr and Tsachy Weissman. Geometric lower bounds for distributed parameter estimation under communication constraints. arXiv preprint arXiv:1802.08417 2018."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"{HS18} Uri Hadar and Ofer Shayevitz. Distributed estimation of Gaussian correlations. arXiv preprint arXiv:1805.12472 2018.  {HS18} Uri Hadar and Ofer Shayevitz. Distributed estimation of Gaussian correlations. arXiv preprint arXiv:1805.12472 2018.","DOI":"10.1109\/ISIT.2018.8437823"},{"first-page":"288","volume-title":"Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on","author":"Indyk Piotr","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057118"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"{KN96} Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press 1996.  {KN96} Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press 1996.","DOI":"10.1017\/CBO9780511574948"},{"volume-title":"New York: Dover, 1968","year":"1959","author":"Kullback S.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","unstructured":"{LC06} Erich L. Lehmann and George Casella. Theory of point estimation. Springer Science & Business Media 2006.  {LC06} Erich L. Lehmann and George Casella. Theory of point estimation. Springer Science & Business Media 2006."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541458"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282547"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746104"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.32917\/hmj\/1206137153"},{"first-page":"2210","volume-title":"Proc. 2012 IEEE International Symposium on Information Theory","author":"Polyanskiy Yury","key":"e_1_3_2_1_25_1"},{"first-page":"249","volume-title":"Convexity and Concentration","author":"Polyanskiy Yury","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2206793"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a008"},{"first-page":"2320","volume-title":"2018 IEEE International Symposium on Information Theory (ISIT)","author":"Sahasranand KR","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","unstructured":"{Tsy09} \n      \n      Alexandre B.\n       \n      Tsybakov\n    .\n      \n  \n   \n  Introduction to Nonparametric Estimation\n  . \n  Springer Series in Statistics\n  . \n  Springer-Verlag New York 2009\n  .  {Tsy09} Alexandre B. Tsybakov. Introduction to Nonparametric Estimation. Springer Series in Statistics. Springer-Verlag New York 2009."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.2012.001"},{"volume-title":"American Mathematical Soc.","year":"2003","author":"Villani C\u00e9dric","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","unstructured":"{VT04} Harry L. Van Trees. Detection estimation and modulation theory part I: detection estimation and linear modulation theory. John Wiley & Sons 2004.  {VT04} Harry L. Van Trees. Detection estimation and modulation theory part I: detection estimation and linear modulation theory. John Wiley & Sons 2004."},{"first-page":"2844","volume-title":"Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on","author":"Xiang Yu","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.2629"},{"key":"e_1_3_2_1_38_1","first-page":"2336","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang Yuchen","year":"2013"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316332","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":38,"alternative-id":["10.1145\/3313276.3316332","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316332","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}