{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:41Z","timestamp":1740097301472,"version":"3.37.3"},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_553","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:15:58Z","timestamp":1553098558000},"page":"828-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Approaches to Answering Queries"],"prefix":"10.1007","author":[{"given":"Aleksandar","family":"Nikolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"1","key":"159_CR775","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora S, Hazan E, Kale S (2012) The multiplicative weights update method: a meta-algorithm and applications. Theory Comput 8(1):121\u2013164","journal-title":"Theory Comput"},{"key":"159_CR776","doi-asserted-by":"crossref","unstructured":"Bhaskara A, Dadush D, Krishnaswamy R, Talwar K (2012) Unconditional differentially private mechanisms for linear queries. In: Proceedings of the 44th symposium on theory of computing (STOC\u201912), New York. ACM, New York, pp\u00a01269\u20131284. DOI10.1145\/2213977.2214089, \n                  http:\/\/doi.acm.org\/10.1145\/2213977.2214089","DOI":"10.1145\/2213977.2214089"},{"key":"159_CR777","doi-asserted-by":"crossref","unstructured":"Blum A, Ligett K, Roth A (2008) A learning theory approach to non-interactive database privacy. In: Proceedings of the 40th annual ACM symposium on theory of computing (STOC\u201908), Victoria. ACM, New York, pp\u00a0609\u2013618. \n                  http:\/\/doi.acm.org\/10.1145\/1374376.1374464","DOI":"10.1145\/1374376.1374464"},{"issue":"2","key":"159_CR778","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02772174","volume":"57","author":"J Bourgain","year":"1987","unstructured":"Bourgain J, Tzafriri L (1987) Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis. Isr J Math 57(2):137\u2013224","journal-title":"Isr J Math"},{"key":"159_CR779","unstructured":"Bun M, Ullman J, Vadhan S (2013) Fingerprinting codes and the price of approximate differential privacy. arXiv preprint arXiv:13113158"},{"key":"159_CR780","doi-asserted-by":"crossref","unstructured":"Dinur I, Nissim K (2003) Revealing information while preserving privacy. In: Proceedings of the 22nd ACM symposium on principles of database systems, San Diego, pp\u00a0202\u2013210","DOI":"10.1145\/773153.773173"},{"key":"159_CR781","doi-asserted-by":"crossref","unstructured":"Dwork C, Nissim K (2004) Privacy-preserving datamining on vertically partitioned databases. In: Advances in cryptology \u2013 CRYPTO\u201904, Santa Barbara, pp\u00a0528\u2013544","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"159_CR782","doi-asserted-by":"crossref","unstructured":"Dwork C, Mcsherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: TCC, New York. http:\/\/www.cs.bgu.ac.il\/\\~kobbi\/papers\/sensitivity-tcc-final.pdf","DOI":"10.1007\/11681878_14"},{"key":"159_CR783","doi-asserted-by":"crossref","unstructured":"Dwork C, McSherry F, Talwar K (2007) The price of privacy and the limits of LP decoding. In: Proceedings of the thirty-ninth annual ACM symposium on theory of computing (STOC\u201907), San Diego. ACM, New York, pp\u00a085\u201394. DOI10.1145\/1250790.1250804, \n                  http:\/\/doi.acm.org\/10.1145\/1250790.1250804","DOI":"10.1145\/1250790.1250804"},{"key":"159_CR784","doi-asserted-by":"crossref","unstructured":"Gupta A, Roth A, Ullman J (2012) Iterative constructions and private data release. In: TCC, Taormina, pp\u00a0339\u2013356. \n                  http:\/\/dx.doi.org\/10.1007\/978-3-642-28914-9_19","DOI":"10.1007\/978-3-642-28914-9_19"},{"key":"159_CR785","doi-asserted-by":"crossref","unstructured":"Hardt M, Rothblum G (2010) A multiplicative weights mechanism for privacy-preserving data analysis. In: Proceedings of the 51st foundations of computer science (FOCS), Las Vegas. IEEE","DOI":"10.1109\/FOCS.2010.85"},{"key":"159_CR786","doi-asserted-by":"crossref","unstructured":"Hardt M, Talwar K (2010) On the geometry of differential privacy. In: Proceedings of the 42nd ACM symposium on theory of computing (STOC\u201910), Cambridge. ACM, New York, pp\u00a0705\u2013714. DOI10.1145\/1806689.1806786, \n                  http:\/\/doi.acm.org\/10.1145\/1806689.1806786","DOI":"10.1145\/1806689.1806786"},{"key":"159_CR787","doi-asserted-by":"crossref","unstructured":"Li C, Hay M, Rastogi V, Miklau G, McGregor A (2010) Optimizing linear counting queries under differential privacy. In: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS\u201910), Indianapolis. ACM, New York, pp\u00a0123\u2013134. \n                  http:\/\/doi.acm.org\/10.1145\/1807085.1807104","DOI":"10.1145\/1807085.1807104"},{"issue":"2","key":"159_CR788","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0195-6698(86)80041-5","volume":"7","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Spencer J, Vesztergombi K (1986) Discrepancy of set-systems and matrices. Eur J Comb 7(2):151\u2013160","journal-title":"Eur J Comb"},{"key":"159_CR789","doi-asserted-by":"crossref","unstructured":"Muthukrishnan S, Nikolov A (2012) Optimal private halfspace counting via discrepancy. In: Proceedings of the 44th symposium on theory of computing (STOC\u201912), New York. ACM, New York, pp\u00a01285\u20131292. DOI10.1145\/2213977.2214090, \n                  http:\/\/doi.acm.org\/10.1145\/2213977.2214090","DOI":"10.1145\/2213977.2214090"},{"key":"159_CR790","doi-asserted-by":"crossref","unstructured":"Nikolov A, Talwar K, Zhang L (2013) The geometry of differential privacy: the sparse and approximate cases. In: Proceedings of the 45th annual ACM symposium on symposium on theory of computing (STOC\u201913), Palo Alto. ACM, New York, pp\u00a0351\u2013360. DOI10.1145\/2488608.2488652, \n                  http:\/\/doi.acm.org\/10.1145\/2488608.2488652","DOI":"10.1145\/2488608.2488652"},{"key":"159_CR791","doi-asserted-by":"crossref","unstructured":"Plotkin SA, Shmoys DB, Tardos E (1995) Fast approximation algorithms for fractional packing and covering problems. Math Oper Res 20(2):257\u2013301. DOI10.1287\/moor.20.2.257, \n                  http:\/\/dx.doi.org\/10.1287\/moor.20.2.257","DOI":"10.1287\/moor.20.2.257"},{"issue":"1","key":"159_CR792","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02809903","volume":"122","author":"R Vershynin","year":"2001","unstructured":"Vershynin R (2001) John\u2019s decompositions: selecting a large part. Isr J Math 122(1):253\u2013277","journal-title":"Isr J Math"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T17:34:52Z","timestamp":1553103292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_553","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}