**CS153: Current Topics in Theoretical Computer Science
(Spring 2018) **

Instructor: Chris Umans

Office: Annenberg 311

Times: Tu/Th 1:00-2:25 in Annenberg 314

Office hours: email me

Announcements:

- Presentation times and topics have been posted.
- The second problem set has been posted.

Handouts:

- Syllabus (pdf)

Lectures (posted notes are not guaranteed to be complete and may contain typos!):

Problem sets:

- Problem Set 1: (pdf, LaTeX source)
- Problem Set 2: (pdf, LaTeX source)

Surveys, monographs, and papers:

- P. Beame. Communication Complexity: An Introduction and Survey with Open Problems. 2010.
- M. Goos, T. Pitassi, and T. Watson. The landscape of communication complexity classes. 2018.
- T. Lee and A. Schraibman Lower bounds in communication complexity . 2009.
- S. Lovett. Recent advances on the log-rank conjecture in communication complexity. 2014.
- A. Rao and A. Yehudayoff. Communication complexity (draft of a textbook)
- A. Razborov. Communication Complexity. 2011.
- T. Roughgarden. Communication complexity (for algorithm designers) 2016.
- A. Sherstov. Communication Complexity Theory: Thirty-Five Years of Set Disjointness 2014.

Other communication complexity courses with some notes or slides online:

- Xi Chen
- Prahladh Harsha, Jaikumar Radhakrishnan and Meena Mahajan
- Hamed Hatami
- Troy Lee
- Jakob Nordstrom
- Toni Pitassi
- Ronnitt Rubinfeld
- Sasha Sherstov

Presentations:

- Spencer (May 22 #1): extension complexity of polytopes
- Vivek (May 22 #2): Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-offs
- Ola (May 24 #1): Learning complexity vs. communication complexity
- Amulya (May 24 #2): communication complexity and streaming algorithms
- Siddharth (May 29 #1): Communication complexity of combinatorial auctions
- Jing (May 29 #2): distributed computing applications
- Timur (May 31 #1): How to compress interactive communication
- Matthew (May 31 #2): Towards coding for maximum errors in interactive communication