{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:31:10Z","timestamp":1764873070789,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536465","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"361-370","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Private coresets"],"prefix":"10.1145","author":[{"given":"Dan","family":"Feldman","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Be'er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Geometric approximations via coresets. Combinatorial and Computational Geometry -- MSRI Publications, 52:1--30","author":"Agarwal P.","year":"2005","unstructured":"P. Agarwal , S. Har-Peled , and K.R. Varadarajan . Geometric approximations via coresets. Combinatorial and Computational Geometry -- MSRI Publications, 52:1--30 , 2005 . P. Agarwal, S. Har-Peled, and K.R. Varadarajan. Geometric approximations via coresets. Combinatorial and Computational Geometry -- MSRI Publications, 52:1--30, 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740826"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265569"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778638"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997843"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109687"},{"key":"e_1_3_2_1_12_1","first-page":"257","volume-title":"SODA","author":"Clarkson K.L.","year":"2005","unstructured":"K.L. Clarkson . Subgradient and sampling algorithms for l1 regression . SODA , pages 257 -- 266 , 2005 . K.L. Clarkson. Subgradient and sampling algorithms for l1 regression. SODA, pages 257--266, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435297"},{"key":"e_1_3_2_1_14_1","first-page":"30","article-title":"Sublinear-time approximation algorithms for clustering via random sampling","author":"Czumaj A.","year":"2007","unstructured":"A. Czumaj and C. Sohler . Sublinear-time approximation algorithms for clustering via random sampling . RSA: Random Structures & Algorithms , 30 , 2007 . A. Czumaj and C. Sohler. Sublinear-time approximation algorithms for clustering via random sampling. RSA: Random Structures & Algorithms, 30, 2007.","journal-title":"RSA: Random Structures & Algorithms"},{"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\/11787006_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"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.1007\/978-3-540-28628-8_32"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_26"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.22"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247073"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247072"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195908002520"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060622"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056141"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875595"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_27"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064114"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_3_2_1_33_1","first-page":"32","article-title":"High-dimensional shape fitting in linear time","author":"Har-Peled S.","year":"2004","unstructured":"S. Har-Peled and K.R. Varadarajan . High-dimensional shape fitting in linear time . GEOMETRY: Discrete & Computational Geometry , 32 , 2004 . S. Har-Peled and K.R. Varadarajan. High-dimensional shape fitting in linear time. GEOMETRY: Discrete & Computational Geometry, 32, 2004.","journal-title":"GEOMETRY: Discrete & Computational Geometry"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513440"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_55"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142373"},{"key":"e_1_3_2_1_39_1","first-page":"383","volume-title":"Charu Aggarwal and Philip S. Yu","author":"Nissim K.","unstructured":"K. Nissim . Private data analysis via output perturbation. In Charu Aggarwal and Philip S. Yu , editors, Privacy-Preserving Data Mining, Models and Algorithms , pages 383 -- 414 . K. Nissim. Private data analysis via output perturbation. In Charu Aggarwal and Philip S. Yu, editors, Privacy-Preserving Data Mining, Models and Algorithms, pages 383--414."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_1_41_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 . VLDB , pages 531 -- 542 , 2007 . V. Rastogi, S. Hong, and D. Suciu. The boundary between privacy and utility in data publishing. VLDB, pages 531--542, 2007."}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":41,"alternative-id":["10.1145\/1536414.1536465","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536465","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}