Students should consult this page at least once a week for important information.
POSTED SEPT 24: Topics for Presention listed below. Due date for picking a topic is Oct 3!
Nov 4 Game theory (Tyrone Strangeway and Jai Balasundaram);
Nov 11 Distributed Computing (Trevor Brown); Data Structures (Hao Wei);
Nov 18 Additive Combinatorics and Log Rank (Lalla Mouatadid); Property Testing (Nicolas Pena);
Nov 25 Information Complexity (Robert Robere).
Lectures: Tuesdays 3-5 GB 248 (NOTE NEW ROOM!)
Instructor: Toniann Pitassi
Office: Sandford Fleming 2305A, 978-3695
Office Hours: by appointment
HOMEWORK
RESEARCH PRESENTATION
LINKS TO BOOKS, BOOK CHAPTERS, LECTURE NOTES
LINKS TO PAPERS
COURSE LECTURE NOTES
Deterministic, probabilistic, nondeterministic communication complexity.
Newman's theorem (private versus public coins), Important functions (equality, set disjointness)
Deterministic Lower Bounds: (1) rectangles; (2) fooling set argument; (3) rank lower bound method; Covers
Randomized Lower Bounds: Distributional Complexity and Yao's theorem, Discrepancy
Discrepancy method continued, Sherstov Dual Polynomial Method
Applications of Communication Complexity -- Monotone Circuit Depth
Monotone Circuit Depth Bounds via Set Disjointness, cont'd
Proof Complexity Lower Bounds via Set Disjointness
Extended Formulations and Communication Complexity
Game theory and Communication Complexity
Distributed Computing and Communication Complexity
Data Structures and Communication Complexity
Additive Combinatorics
Property Testing and Communication Complexity
Information Complexity