Subject in 2022/2023: Data Streaming Algorithms
Teaching Staff:
|
![]() |
Week | Lecture | Subject | Topics | Slides | Recording | Readings |
---|---|---|---|---|---|---|
W1: | 1 | What is streaming? | Introduction | video | ||
2 | Probability overview | Markov, Chebyshev, Chernoff | PDF PDF (Adv Alg) | video video (Adv Alg) | [2] | |
W2: Exercise Sheet 1 PDF Solutions | 3 | Finding frequent elements | The Misra-Gries algorithm | video | Ch. 1 in [1] | |
4 | Counting distinct elements | The Tidemark algorithm | video | Ch. 2 in [1] | ||
W3: Exercise Sheet 2 PDF Solutions HLL-answers.py | 5 | Approximate counting | The Morris counter | video | Ch. 4 in [1] | |
6 | Finding frequent items | CountSketch/Min Sketch | video | Ch. 5 in [1] | ||
W4: Exercise Sheet 3 PDF Solution countsketch.py countsketch-answers.py | 7 | Sparse recovery | Fingerprinting and hashing | video | Ch. 9 in [1] | |
8 | l0-sampling | Sample by frequency | video | Sec. 10.2 in [1] | ||
W5: Exercise Sheet 4 PDF Solution | 9 | Graph streams? | Connectivity, Bipartiteness | video | Sec. 14.2, 14.3 in [1] | |
10 | Shortest distances | Computing spanners | video | Sec. 14.4 in [1] | ||
W6: | READING WEEK | |||||
W7: | 11 | Matchings | Unweighted and weighted | video | Sec. 15 in [1] | |
12 | The AGM sketch | Connectivity with deletions | video | Sec. 16 in [1], [5] | ||
W8: Exercise Sheet 5 PDF Solution | 13 | Lower Bounds I | Communication complexity | video | Ch. 18 in [1] | |
14 | Lower Bounds II | Yao's Lemma, INDEX problem | video | Ch. 18 in [1] | ||
W12: | RECAP WEEK |