Algorithms For Big Data (Compsci 229R), Lecture 9

youtube.com - Harvard University


Hqdefault

Communication complexity (indexing, gap hamming) + application to median and F0 lower bounds.