{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:06:51Z","timestamp":1775282811888,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214088","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1255-1268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Beating randomized response on incoherent matrices"],"prefix":"10.1145","author":[{"given":"Moritz","family":"Hardt","sequence":"first","affiliation":[{"name":"IBM Almaden Research, San Jose, CA, USA"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380858"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_20"},{"key":"e_1_3_2_2_6_1","volume-title":"Lower bounds in differential privacy. CoRR, abs\/1107.2183","author":"De A.","year":"2011","unstructured":"A. De . Lower bounds in differential privacy. CoRR, abs\/1107.2183 , 2011 . A. De. Lower bounds in differential privacy. CoRR, abs\/1107.2183, 2011."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873691"},{"key":"e_1_3_2_2_12_1","volume-title":"Iterative constructions and private data release. CoRR, abs\/1107.3731","author":"Gupta A.","year":"2011","unstructured":"A. Gupta , A. Roth , and J. Ullman . Iterative constructions and private data release. CoRR, abs\/1107.3731 , 2011 . A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. CoRR, abs\/1107.3731, 2011."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_3_2_2_14_1","volume-title":"Personal communication","author":"Kapralov M.","year":"2011","unstructured":"M. Kapralov , F. McSherry , and K. Talwar . Personal communication . 2011 . M. Kapralov, F. McSherry, and K. Talwar. Personal communication. 2011."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"Matousek J.","year":"2002","unstructured":"J. Matousek . Lectures on Discrete Geometry . Springer-Verlag New York, Inc. , 2002 . J. Matousek. Lectures on Discrete Geometry. Springer-Verlag New York, Inc., 2002."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_2_18_1","volume-title":"Proc. 14th Conference on Artificial Intelligence and Statistics (AISTATS)","author":"Mohri M.","year":"2011","unstructured":"M. Mohri and A. Talwalkar . Can matrix coherence be efficiently and accurately estimated ? In Proc. 14th Conference on Artificial Intelligence and Statistics (AISTATS) , 2011 . M. Mohri and A. Talwalkar. Can matrix coherence be efficiently and accurately estimated? In Proc. 14th Conference on Artificial Intelligence and Statistics (AISTATS), 2011."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_3_2_2_22_1","volume-title":"Proc. 26th Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Talwalkar A.","year":"2010","unstructured":"A. Talwalkar and A. Rostamizadeh . Matrix coherence and the nystrom method . In Proc. 26th Conference on Uncertainty in Artificial Intelligence (UAI) , 2010 . A. Talwalkar and A. Rostamizadeh. Matrix coherence and the nystrom method. In Proc. 26th Conference on Uncertainty in Artificial Intelligence (UAI), 2010."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214088","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":22,"alternative-id":["10.1145\/2213977.2214088","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214088","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}