[22] Marianne Durand and Philippe Flajolet. Loglog counting of large cardinalities (extended abstract). In Embedded Systems and Applications, 2003.
[23] Cynthia Dwork, Frank McSherry, and Kunal Talwar. The price of privacy and the limits of LP decoding. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 85-94, 2007.
[24] Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil P. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 381-390, 2009.
[25] Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N. Rothblum. Differential privacy under continual observation. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 715-724, 2010.
[26] Cynthia Dwork, Moni Naor, Omer Reingold, and Guy N. Rothblum. Pure differential privacy for rectangle queries via private partitions. In Advances in Cryptology - ASIACRyPT, volume 9453, pages 735-751, 2015.
[27] Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam D. Smith. Calibrating noise to sensitivity in private data analysis. J. Priv. Confidentiality, 7(3):17-51, 2016.
[28] Alexander Edmonds, Aleksandar Nikolov, and Jonathan R. Ullman. The power of factorization mechanisms in local and central differential privacy. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 425-438, 2020.
[29] Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, and Peilin Zhong. Differentially private continual releases of streaming frequency moment estimations. In Proceedings, Innovations in Theoretical Computer Science (ITCS), volume 251, pages 48:1-48:24, 2023.
[30] Cristian Estan, George Varghese, and Michael E. Fisk. Bitmap algorithms for counting active flows on high-speed links. IEEE/ACM Trans. Netw., 14(5):925-937, 2006.
[31] Hendrik Fichtenberger, Monika Henzinger, and Wolfgang Ost. Differentially private algorithms for graphs under continual observation. In European Symposium on Algorithms (ESA), volume 204, pages 42:1-42:16, 2021.
[32] Philippe Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182-209, 1985.
[33] Philippe Flajolet, Éric Fusy, Olivier Gandouet, and Frédéric Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete Mathematics & Theoretical Computer Science, pages 137-156, 2007.
[34] Badih Ghazi, Ben Kreuter, Ravi Kumar, Pasin Manurangsi, Jiayu Peng, Evgeny Skvortsov, Yao Wang, and Craig Wright. Multiparty reach and frequency histogram: Private, secure, and practical. Proc. Priv. Enhancing Technol., 2022(1):373-395, 2022.
[35] Badih Ghazi, Ravi Kumar, Jelani Nelson, and Pasin Manurangsi. Private counting of distinct and  $k$ -occurring items in time windows. In Proceedings, Innovations in Theoretical Computer Science (ITCS), volume 251, pages 55:1-55:24, 2023.
[36] Phillip B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proceedings, Very Large Databases (VLDB) Endowment, 2001.
[37] Phillip B. Gibbons and Srikanta Tirthapura. Estimating simple functions on the union of data streams. In Proceedings, ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 281-291, 2001.
[38] Moritz Hardt and Kunal Talwar. On the geometry of differential privacy. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 705-714, 2010.