uclagrades.com

COM SCI 285CC: Communication Complexity

Mathematical maturity strongly encouraged. Introduction to communication complexity with coverage of fundamentals, key classic theorems, and current research directions. Consider function f whose arguments are distributed among several parties, making it impossible for any one party to compute f in isolation. Communication complexity theory studies how many bits of communication are needed to evaluate f. Pioneered in 1979 by Turing award winner Andrew Yao, communication complexity has become central area of theoretical computer science with deep open questions, beautiful mathematics, and vast array of applications.

4 units, lecture

Loading...

ALEXANDER SHERSTOVFall 20251090.0% (9)

A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.

Available Academic Terms
Fall 2022 · Fall 2023 · Fall 2025

This website is not affiliated with UCLA. Grade distribution data from 2021–2022 was sourced through a February 2023 public records request made under the California Public Records Act. 40+ UCLA students paid $131.25 to obtain these records. Grade distribution data from 2022–2023 and 2024–2025 were sourced similarly.

UCLA students can download the data on Google Drive (log into your UCLA Google Account to access): Fall 2021–Summer 2022, Fall 2022–Spring 2023, Summer 2023–Spring 2024, Summer 2024–Spring 2025, Summer 2025–Fall 2025, Winter 2026–Spring 2026

Source code for this site is on GitHub; contributions are welcome and appreciated. Questions, comments, bug reports, and feature requests are welcome at this link.