[DMNS06] C. Dwork, F. McSherry, K. Nissim, and A. Smith. “Calibrating noise to sensitivity in private data analysis”. In: Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings 3. Springer. 2006, pp. 265-284 (cit. on pp. 1, 8, 9).
[DN03] I. Dinur and K. Nissim. “Revealing information while preserving privacy”. In: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 2003, pp. 202-210 (cit. on p. 1).
[DNPRY10] C. Dwork, M. Naor, T. Pitassi, G. N. Rothblum, and S. Yekhanin. “Pan-Private Streaming Algorithms”. In: Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings. Ed. by A. C. Yao. Tsinghua University Press, 2010, pp. 66-80. URL: http://conference.iis.tsinghua.edu.cn/ICS2010/content/papers/6.html (cit. on p. 6).
[DR14] C. Dwork and A. Roth. “The algorithmic foundations of differential privacy”. In: Foundations and Trends® in Theoretical Computer Science 9.3–4 (2014), pp. 211–407. URL: https://www.cis.upenn.edu/~aaroth/Papers/privacybook.pdf (cit. on p. 8).
[DR16] C. Dwork and G. N. Rothblum. “Concentrated differential privacy”. In: arXiv preprint arXiv:1603.01887 (2016). URL: https://arxiv.org/abs/1603.01887 (cit. on p. 9).
[DTT22] C. Dickens, J. Thaler, and D. Ting. "Order-Invariant Cardinality Estimators Are Differentially Private". In: NeurIPS. 2022. URL: https://arxiv.org/abs/2203.15400 (cit. on p. 5).
[DVGM22] D. Desfontaines, J. Voss, B. Gipson, and C. Mandayam. "Differentially private partition selection". In: Proc. Priv. Enhancing Technol. 2022.1 (2022), pp. 339-352. URL: https://doi.org/10.2478/popets-2022-0017 (cit. on p. 6).
[FDY22] J. Fang, W. Dong, and K. Yi. "Shifted Inverse: A General Mechanism for Monotonic Functions under User Differential Privacy". In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS '22. Los Angeles, CA, USA: Association for Computing Machinery, 2022, 1009-1022. ISBN: 9781450394505. URL: https://cse.hkust.edu.hk/~yike/ShiftedInverse.pdf (cit. on pp. 6, 8, 11).
[GGKSSY20] S. Gopi, P. Gulhane, J. Kulkarni, J. H. Shen, M. Shokouhi, and S. Yekhanin. "Differentially private set union". In: International Conference on Machine Learning. PMLR. 2020, pp. 3627-3636. URL: https://arxiv.org/abs/2002.09745 (cit. on p. 6).
[GKNM23] B. Ghazi, R. Kumar, J. Nelson, and P. Manurangsi. "Private Counting of Distinct and k-Occurring Items in Time Windows". In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA. Ed. by Y. T. Kalai. Vol. 251. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, 55:1-55:24. URL: https://doi.org/10.4230/LIPiCs.ITCS.2023.55 (cit. on p. 6).
[God] W. Goddard. A brief undergraduate text for Algorithms. Chapter G4: Approximation Algorithms. URL: https://people.computing.clemson.edu/~goddard/texts/algor/G4.pdf (cit. on p. 19).
[GRS09] A. Ghosh, T. Roughgarden, and M. Sundararajan. "Universally utility-maximizing privacy mechanisms". In: Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009, pp. 351-360. URL: https://arxiv.org/abs/0811.2841 (cit. on p. 9).
[HK73] J. E. Hopcroft and R. M. Karp. “An  $n^{5/2}$  Algorithm for Maximum Matchings in Bipartite Graphs”. In: SIAM J. Comput. 2.4 (1973), pp. 225–231. URL: https://doi.org/10.1137/0202019 (cit. on pp. 3, 4).
[HTC23] J. Hehir, D. Ting, and G. Cormode. "Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting". In: arXiv preprint arXiv:2302.02056 (2023). URL: https://arxiv.org/abs/2302.02056 (cit. on p. 5).