Lecture Notes

March 31, 2014 Lecture 1 Introduction, Property testing for element distinctness

April 2, 2014 Lecture 2 Hashing and k-wise independence, Estimating number of distinct elements in a stream

April 7, 2014 Lecture 3 Estimating the number of distinct elements in a stream

April 9, 2014 Lecture 4 Finding heavy hitters in data streams, Count-Min sketch

April 14, 2014 Lecture 5 More heavy hitters, Count sketch

April 16, 2014 Lecture 6 F₂ approximation: Tug-of-War sketch

April 21, 2014 Lecture 7 Property Testing Distributions

April 23, 2014 Lecture 8 Pseudorandomness and Sketching

April 28, 2014 Lecture 9 Approximating F_p for p>2

April 30, 2014 Lecture 10 Johnson-Lindenstrass Lemma

May 5, 2014 Lecture 11 Johnson-Lindenstrass Lemma Lower Bound, Communication Complexity

May 7, 2014 Lecture 12 Communication Complexity and Streaming Lower Bounds

May 12, 2014 Lecture 13 Geometric Streams and Coresets

May 14, 2014 Lecture 14 Streaming from Coresets, clustering

May 21, 2014 Lecture 15 Property Testing for Sortedness, Connectivity, MST Weight and Connected Components Estimation

May 28, 2014 Lecture 16 Property Testing of Functions, Junta Testing

June 4, 2014 Lecture 17 Tolerant Testing, Vertex Cover Approximation, Graph Spanners