$\left[\mathrm{G}^{+}16\right]$  Andy Greenberg et al. Apple's "differential privacy" is about collecting your data—but not your data. Wired, June, 13:1, 2016.
[GDGK20] Quan Geng, Wei Ding, Ruiqi Guo, and Sanjiv Kumar. Tight analysis of privacy and utility tradeoff in approximate differential privacy. In The 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), volume 108 of Proceedings of Machine Learning Research, pages 89–99. PMLR, 2020.
[HKR12] Justin Hsu, Sanjeev Khanna, and Aaron Roth. Distributed private heavy hitters. In Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 39, pages 461-472. Springer, 2012.
[HR10] Moritz Hardt and Guy N Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In 2010 IEEE 51st annual symposium on foundations of computer science, pages 61-70. IEEE, 2010.
[HRMS09] Michael Hay, Vibhor Rastogi, Gerome Miklau, and Dan Suciu. Boosting the accuracy of differentially-private histograms through consistency. arXiv preprint arXiv:0904.0942, 2009.
[HY21] Ziyue Huang and Ke Yi. Approximate range counting under differential privacy. In 37th International Symposium on Computational Geometry (SoCG 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
[IM98] Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 604-613, 1998.
[Kap15] Michael Kapralov. Smooth tradeoffs between insert and query complexity in nearest neighbor search. pages 329-342, New York, NY, USA, 2015. ACM.
[LHMW14] Chao Li, Michael Hay, Gerome Miklau, and Yue Wang. A data-and workload-aware algorithm for range queries under differential privacy. arXiv preprint arXiv:1410.0265, 2014.
$\left[\mathrm{LJW}^{+}07\right]$  Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. Multi-probe lsh: efficient indexing for high-dimensional similarity search. In VLDB, 2007.
[LN14] Huy Le Nguyen. Algorithms for high dimensional data. PhD thesis, Princeton University, 2014.
[Mat99] Jiri Matoušek. Geometric discrepancy: An illustrated guide. 1999.
[MR04] Manor Mendel and Assaf Naor. Euclidean quotients of finite metric spaces. Advances in Mathematics, 189(2):451-494, 2004.
[MN12] S. Muthukrishnan and Aleksandar Nikolov. Optimal private halfspace counting via discrepancy. In Proceedings of the 44th Symposium on Theory of Computing Conference (STOC), pages 1285–1292. ACM, 2012.
[NTZ13] Aleksandar Nikolov, Kunal Talwar, and Li Zhang. The geometry of differential privacy: the sparse and approximate cases. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 351-360, 2013.
[Pan06] Rina Panigrahy. Entropy based nearest neighbor search in high dimensions. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 1186-1195, 2006.
[QYL13a] Wahbeh Qardaji, Weining Yang, and Ninghui Li. Differentially private grids for geospatial data. In 2013 IEEE 29th international conference on data engineering (ICDE), pages 757-768. IEEE, 2013.
[QYL13b] Wahbeh Qardaji, Weining Yang, and Ninghui Li. Understanding hierarchical methods for differentially private histograms. Proceedings of the VLDB Endowment, 6(14):1954-1965, 2013.