This text collects the lecture notes from the author's course "Communication Complexity (for Algorithm Designers)," taught at Stanford in the winter quarter of 2015. The two primary goals of the text are:
(1) Learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (DISJOINTNESS, INDEX, GAP-HAMMING, etc.).
(2) Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.
Along the way, readers will also:
(3) Get exposure to lots of cool computational models and some famous results about them - data streams and linear sketches, compressive sensing, space-query time trade-offs in data structures, sublinear-time algorithms, and the extension complexity of linear programs.
(4) Scratch the surface of techniques for proving communication complexity lower bounds (fooling sets, corruption arguments, etc.).
