[Ilv20] C. Ilvento. “Implementing the exponential mechanism with base-2 differential privacy”. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. 2020, pp. 717–742. URL: https://arxiv.org/abs/1912.04222 (cit. on p. 21).
[Kar73] A. Karzanov. "An exact estimate of an algorithm for finding a maximum flow, applied to the problem "on representatives". In: Issues of Cybernetics. Proc. of the Seminar on Combinatorial Mathematics (1973), pp. 66-70 (cit. on pp. 3, 4).
[KKMN09] A. Korolova, K. Kenthapadi, N. Mishra, and A. Ntoulas. "Releasing search queries and clicks privately". In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, April 20-24, 2009. Ed. by J. Quemada, G. León, Y. S. Maarek, and W. Nejdl. ACM, 2009, pp. 171-180. URL: https://doi.org/10.1145/1526709.1526733 (cit. on p. 6).
[KLNRS11] S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith. "What can we learn privately?" In: SIAM Journal on Computing 40.3 (2011), pp. 793-826. URL: https://arxiv.org/abs/0803.0924 (cit. on p. 5).
[KWSMW20] B. Kreuter, C. W. Wright, E. S. Skvortsov, R. Mirisola, and Y. Wang. "Privacy-preserving secure cardinality and frequency estimation". In: (2020). URL: https://research.google/pubs/pub49177/ (cit. on p. 6).
[MDPHNP11] A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts. “Learning Word Vectors for Sentiment Analysis”. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies. Portland, Oregon, USA: Association for Computational Linguistics, June 2011, pp. 142–150. URL: http://www.aclweb.org/anthology/P11-1015 (cit. on p. 9).
[MS20] R. McKenna and D. R. Sheldon. "Permute-and-Flip: A new mechanism for differentially private selection". In: Advances in Neural Information Processing Systems 33 (2020), pp. 193–203. URL: https://arxiv.org/abs/2010.12603 (cit. on p. 21).
[MT07] F. McSherry and K. Talwar. "Mechanism design via differential privacy". In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE. 2007, pp. 94-103 (cit. on pp. 2, 9).
[N20] L. N. IMDB Dataset of 50K Movie Reviews. English. 2020. URL: https://www.kaggle.com/datasets/lakshmi25npathi/imdb-dataset-of-50k-movie-reviews (cit. on p. 9).
[NLM19] J. Ni, J. Li, and J. J. McAuley. “Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects”. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP 2019, Hong Kong, China, November 3-7, 2019. Ed. by K. Inui, J. Jiang, V. Ng, and X. Wan. Association for Computational Linguistics, 2019, pp. 188-197. URL: https://doi.org/10.18653/v1/D19-1018 (cit. on p. 9).
[PS20] R. Pagh and N. M. Stausholm. "Efficient Differentially Private  $F\_0$  Linear Sketching". In: arXiv preprint arXiv:2001.11932 (2020). URL: https://arxiv.org/abs/2001.11932 (cit. on p. 5).
[RCR22] A. Rivera Cardoso and R. Rogers. "Differentially Private Histograms under Continual Observation: Streaming Selection into the Unknown". In: Proceedings of The 25th International Conference on Artificial Intelligence and Statistics. Ed. by G. Camps-Valls, F. J. R. Ruiz, and I. Valera. Vol. 151. Proceedings of Machine Learning Research. PMLR, 2022, pp. 2397-2419. URL: https://arxiv.org/abs/2103.16787 (cit. on p. 6).
[RS15] S. Raskhodnikova and A. D. Smith. "Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions". In: CoRR abs/1504.07912 (2015). arXiv: 1504.07912. URL: http://arxiv.org/abs/1504.07912 (cit. on pp. 2, 8, 9, 20).