{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:50:48Z","timestamp":1781077848524,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488652","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"351-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":88,"title":["The geometry of differential privacy"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Nikolov","sequence":"first","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Microsoft Reserach SVC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265569"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2047241"},{"key":"e_1_3_2_1_4_1","first-page":"1405","volume-title":"Handbook of combinatorics (vol. 2)","author":"Beck J.","year":"1995","unstructured":"J. Beck and V. T. S\u00f3s . Handbook of combinatorics (vol. 2) . chapter Discrepancy theory, pages 1405 -- 1446 . MIT Press , Cambridge, MA, USA , 1995 . J. Beck and V. T. S\u00f3s. Handbook of combinatorics (vol. 2). chapter Discrepancy theory, pages 1405--1446. MIT Press, Cambridge, MA, USA, 1995."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214089"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_3_2_1_8_1","volume-title":"Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis. Israel journal of mathematics, 57(2):137--224","author":"Bourgain J.","year":"1987","unstructured":"J. Bourgain and L. Tzafriri . Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis. Israel journal of mathematics, 57(2):137--224 , 1987 . J. Bourgain and L. Tzafriri. Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis. Israel journal of mathematics, 57(2):137--224, 1987."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.13"},{"key":"e_1_3_2_1_10_1","volume-title":"ICALP","author":"Chan T.-H. H.","year":"2010","unstructured":"T.-H. H. Chan , E. Shi , and D. Song . Private and continual release of statistics . In ICALP , 2010 . T.-H. H. Chan, E. Shi, and D. Song. Private and continual release of statistics. In ICALP, 2010."},{"key":"e_1_3_2_1_11_1","volume-title":"A discrepancy based approach to integer programming. CoRR, abs\/1111.4649","author":"Chandrasekaran K.","year":"2011","unstructured":"K. Chandrasekaran and S. Vempala . A discrepancy based approach to integer programming. CoRR, abs\/1111.4649 , 2011 . K. Chandrasekaran and S. Vempala. A discrepancy based approach to integer programming. CoRR, abs\/1111.4649, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/507108"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_18"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989347"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_17_1","volume-title":"Our data, ourselves: Privacy via distributed noise generation","author":"Dwork C.","year":"2006","unstructured":"C. Dwork , K. Kenthapadi , F. McSherry , I. Mironov , and M. Naor . Our data, ourselves: Privacy via distributed noise generation , 2006 . C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250804"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_26"},{"key":"e_1_3_2_1_23_1","unstructured":"N. Fawaz S. Muthukrishnan and A. Nikolov. Nearly optimal private convolutions. unpublished manuscript.  N. Fawaz S. Muthukrishnan and A. Nikolov. Nearly optimal private convolutions. unpublished manuscript."},{"key":"e_1_3_2_1_24_1","volume-title":"An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110","author":"Frank M.","year":"1956","unstructured":"M. Frank and P. Wolfe . An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110 , 1956 . M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110, 1956."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1989v064n01ABEH003295"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993742"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_19"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807105"},{"key":"e_1_3_2_1_30_1","volume-title":"NIPS","author":"Hardt M.","year":"2012","unstructured":"M. Hardt , K. Ligett , and F. McSherry . A simple and practical algorithm for differentially private data release . In NIPS , 2012 . To appear. M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In NIPS, 2012. To appear."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"e_1_3_2_1_34_1","first-page":"187","volume-title":"Studies and Essays presented to R. Courant on his 60th Birthday","author":"John F.","year":"1948","unstructured":"F. John . Extremum problems with inequalities as subsidiary conditions. In Studies and Essays presented to R. Courant on his 60th Birthday , pages 187 -- 204 , 1948 . F. John. Extremum problems with inequalities as subsidiary conditions. In Studies and Essays presented to R. Courant on his 60th Birthday, pages 187--204, 1948."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627919"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806795"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.14"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168653"},{"key":"e_1_3_2_1_40_1","volume-title":"Measuring the achievable error of query sets under differential privacy. CoRR, abs\/1202.3399","author":"Li C.","year":"2012","unstructured":"C. Li and G. Miklau . Measuring the achievable error of query sets under differential privacy. CoRR, abs\/1202.3399 , 2012 .\\newpage C. Li and G. Miklau. Measuring the achievable error of query sets under differential privacy. CoRR, abs\/1202.3399, 2012.\\newpage"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(86)80041-5"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"J. Matousek. Geometric Discrepancy (An Illustrated Guide). Springer 1999.  J. Matousek. Geometric Discrepancy (An Illustrated Guide). Springer 1999.","DOI":"10.1007\/978-3-642-03942-3"},{"key":"e_1_3_2_1_43_1","unstructured":"J. Matousek. The determinant bound for discrepancy is almost tight. http:\/\/arxiv.org\/abs\/1101.0767 2011.  J. Matousek. The determinant bound for discrepancy is almost tight. http:\/\/arxiv.org\/abs\/1101.0767 2011."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214090"},{"key":"e_1_3_2_1_45_1","volume-title":"The geometry of differential privacy: the sparse and approximate cases. CoRR, abs\/1212.0297","author":"Nikolov A.","year":"2012","unstructured":"A. Nikolov , K. Talwar , and L. Zhang . The geometry of differential privacy: the sparse and approximate cases. CoRR, abs\/1212.0297 , 2012 . A. Nikolov, K. Talwar, and L. Zhang. The geometry of differential privacy: the sparse and approximate cases. CoRR, abs\/1212.0297, 2012."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165799"},{"key":"e_1_3_2_1_48_1","first-page":"531","volume-title":"VLDB","author":"Rastogi V.","year":"2007","unstructured":"V. Rastogi , S. Hong , and D. Suciu . The boundary between privacy and utility in data publishing . In VLDB , pages 531 -- 542 , 2007 . V. Rastogi, S. Hong, and D. Suciu. The boundary between privacy and utility in data publishing. In VLDB, pages 531--542, 2007."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806794"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02809903"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447831"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1889159.1889173"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350252"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488652"}},"subtitle":["the sparse and approximate cases"],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":53,"alternative-id":["10.1145\/2488608.2488652","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488652","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}