Faculty

Urmila Mahadev
Computational complexity; cryptography; quantum computing
Leonard J. Schulman
Algorithms; coding and communication; combinatorics and probability; quantum computation
Chris Umans
Computational complexity; derandomization; hardness of approximation; algorithms; graph theory
Kewen Wu
Provable quantum advantages; boolean function analysis; quantum cryptography

Postdocs and students, past and present

Some of our courses

Algorithms (undergraduate cs38 and graduate cs139), introduction to cryptography cs152, probability and algorithms cs150, quantum cryptography cs/ph120, complexity theory cs151, current topics in theoretical computer science cs153, quantum computing cs/ph219

Related research groups