# Course reading

Here is a small list of papers for course reading. If you want to read any other paper of your choice, you are welcome to do so.

1. ~~[Faster streaming algorithms for graph spanners](https://arxiv.org/pdf/cs/0611023.pdf) - Baswana.~~ - **Prahladha**
2. [Simpler algorithm for estimating frequency moments of data streams.](https://www.csa.iisc.ac.in/~chandan/research/f_k06.pdf) - Bhuvanagiri, Ganguly, Kesh, Saha.
3. ~~[Graph sparsification in the semi-streaming model](https://arxiv.org/pdf/0902.0140.pdf) - Ahn, Guha.~~ - **Keshav**
4. [Efficient sketches for earth-mover distance, with applications](https://www.cs.cmu.edu/afs/cs/user/dwoodruf/www/emd.pdf) - Andoni, Ba, Indyk, Woodruff.
5. [A near-optimal algorithm for computing the entropy of a stream](https://people.cs.umass.edu/~mcgregor/papers/07-entropy.pdf) - Chakrabarty, Cormode, McGregor.
6. [Distribution Testing Lower Bounds via Reductions from Communication Complexity](https://drops.dagstuhl.de/opus/volltexte/2017/7536/pdf/LIPIcs-CCC-2017-28.pdf) - Blais, Canonne, Gur.
7. ~~[Approximating the Minimum Spanning Tree Weight in Sublinear Time](https://www.cs.princeton.edu/~chazelle/pubs/mstapprox.pdf) - Chazelle, Rubinfeld, Trevisan.~~ - **Arnhav**
8. ~~[Provable and practical approximations for the degree distribution using sublinear graph samples](https://arxiv.org/pdf/1710.08607.pdf) - Eden, Jain, Pinar, Ron, Seshadhri.~~ - **Karthikeyan**
9. [Local graph partitions for approximation and testing](https://math.mit.edu/~kelner/publications/localPartitioningConference.pdf) - Hassidim, Kelner, Nguyen, Onak.
10. ~~[ Tight Lower Bounds for the Distinct Elements Problem](https://ieeexplore.ieee.org/document/1238202) - Indyk, Woodruff~~ - **Alan**