Reading

Hashing

[BM] A. Broder, M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Mathematics Vol. 1, No. 4: 485-509, 2004.
[CM] G. Cormode, S. Muthukrishnan, An Improved Data Stream Summary: The Count-Min Sketch and its Applications, Journal of Algorithms, Vol 55 Issue 1 58-75, 2005.
[Er] J. Erickson. Algorithms, 2019
[MS] B. Maggs, R. Sitaraman, Algorithmic Nuggets in Content Delivery, ACM SIGCOMM Computer Communication Review, Vol 45 Issue 3, 2015.

Data Compression

[Bl] G. E. Blelloch, Introduction to Data Compression , Carnegie Mellon, 2013.
[NG] M. Nelson and J.-L. Gaily The Data Compression Book, , 2nd ed., Wiley, 1995.

Similarity Search

[AI] A. Andoni, P. Indyk: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008).
[AV] D. Arthur, S. Vassilvitskii: k-means++: the advantages of careful seeding. SODA 2007: 1027-1035
[dBCKO] M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd ed., 2008.
[Mat] J. Matousek, Lectures on Discrete Geometry, Springer, 2002.
[AMR] David Arthur, Bodo Manthey, Heiko Röglin: Smoothed Analysis of the k-Means Method. J. ACM 58(5): 19:1-19:31 (2011)
[CGPR] Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon: k-means++: Few more steps yield constant approximation. ICML 2020: 1909-1917

Linear Algebraic Methods

[BP] Belkin, Mikhail, and Partha Niyogi. "Laplacian eigenmaps for dimensionality reduction and data representation." Neural computation 15, no. 6 (2003): 1373-1396.
[Lux] Von Luxburg, U. A tutorial on spectral clustering. Statistics and computing, 17(4), 395-416, 2007.
[Moh] Mohar, B. The Laplacian spectrum of graphs. Graph theory, combinatorics, and applications, 2(871-898), 12, (1991).

Sampling & Estimation

[AHV] P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Geometric approximation via coresets, in Combinatorial and Computational Geometry (J. Goodman, ed.), Cambridge University Press, New York, 2005. [AHV].
[PA] J. Pach and P. K. Agarwal. Combinatorial Geometry, Wiley Interscience, 1995 [PA] (Chapters 15, 16).

Privacy and Fairness

[DR] C. Dwork and A. Roth "The Algorithmic Fundations of Differential Privacy," Foundations and Trends in Theoretical Computer Science, 9, no. 3-4 (2014): 211-407.