Theory at Berkeley (original) (raw)
This is the homepage of the Theory Group in the EECS Department at the University of California, Berkeley.
Berkeley is one of the cradles of modern theoretical computer science. Over the last thirty years, our graduate students and, sometimes, their advisors have done foundational work on NP-completeness, cryptography, derandomization, probabilistically checkable proofs, quantum computing, and algorithmic game theory. The mild weather, celebrated eateries (see here and here), and collaborative atmosphere are known to be conducive to great theory-building and problem-solving.
In addition, Berkeley's Simons Institute for the Theory of Computing regularly brings together theory-oriented researchers from all over the world to collaboratively work on hard problems. The institute organizes a sequence of programs based on topics (see current & future programs and past ones), supported by workshops (seecurrent & future workshops and past ones) and other events.
On Wednesdays, our group comes together for Theory Lunch, an event featuring an informal lunch followed by a whiteboard presentation; this allows for much mingling, including with our friends from Statistics and Math (and, occasionally, Physics and Chemistry). On Fridays, TGIF, the informal student seminar that is off-limits to faculty, provides a comfortable space for students to learn about each other's work.
Some of our current focus is on using computation as a lens to the sciences. Like probabilistic thinking in the last century, computational thinking will give mathematics and, more generally, science a new language to use and the ability to formulate new fundamental questions. We are studying the applications of theoretical computer science in many sciences, including economics (with our work on computational game theory and mechanism design), physics (with our work on random structures and quantum computing), biology, and pure mathematics (especially geometry, functional analysis, and additive number theory). The core problems in algorithms, compexity theory, and cryptography remain, of course, dear to our hearts.
If you would like to join Berkeley's EECS Department as a graduate student, apply to our Ph.D. program. If you are interested in postdoc opportunities at UC Berkeley to work with the theory group, click here.
Events
- Theory Lunch on Wednesdays, 12:00-13:00, Wozniak Lounge
- Theory Seminar on (most) Mondays, 16:00-17:00, Wozniak Lounge
- TGIF on Fridays, 15:30-17:00, Theory Lounge
Courses
Undergraduate Courses
- CS 170: Efficient Algorithms and Intractable Problems
- CS 172: Computability and Complexity
- CS 174: Combinatorics and Discrete Probability
- CS 191: Qubits, Quantum Mechanics, and Computers
- CS 191: Quantum Information Science And Technology
- CS 194: Undergraduate Cryptography
Graduate Courses
- CS 270: Combinatorial Algorithms and Data Structures
- in Fall of 2024 (Satish Rao)
- in Spring of 2023 (Jelani Nelson)
- in Spring of 2021 (Prasad Raghavendra)
- in Spring of 2019 (Satish Rao)
- in Spring of 2017 (Satish Rao)
- in Spring of 2016 (Christos Papadimitriou)
- in Spring of 2012 (Satish Rao, Umesh Vazirani)
- in Spring of 2011 (Satish Rao, Umesh Vazirani)
- CS 271: Randomness and Computation
- in Fall of 2024 (Alistair Sinclair)
- in Fall of 2022 (Alistair Sinclair)
- in Spring of 2020 (Alistair Sinclair)
- in Spring of 2018 (Alistair Sinclair)
- in Fall of 2011 (Alistair Sinclair)
- in Fall of 2008 (Alistair Sinclair)
- CS 273: Foundations of Parallel and Distributed Systems
- in Fall of 2010 (Satish Rao)
- in Spring of 2009 (Satish Rao)
- in Fall of 2006 (Satish Rao)
- in Spring of 2005 (Satish Rao)
- in Spring of 2003 (Satish Rao)
- in Spring of 2001 (Satish Rao)
- CS 274: Computational Geometry
- in Spring of 2019 (Jonathan Shewchuk)
- in Spring of 2015 (Jonathan Shewchuk)
- in Spring of 2013 (Jonathan Shewchuk)
- in Fall of 2009 (Jonathan Shewchuk)
- in Fall of 2006 (Jonathan Shewchuk)
- in Spring of 2005 (Jonathan Shewchuk)
- in Spring of 2003 (Jonathan Shewchuk)
- CS 276: Cryptography
Sanjam Garg- in Fall of 2024 (Sanjam Garg)
- in Fall of 2020 (Raluca Ada Popa, Shafi Goldwasser)
- in Fall of 2018 (Sanjam Garg)
- in Fall of 2017 (Alessandro Chiesa)
- in Fall of 2016 (Sanjam Garg)
- in Fall of 2015 (Alessandro Chiesa)
- in Fall of 2014 (Sanjam Garg)
- in Spring of 2009 (Luca Trevisan)
- in Spring of 2006 (David Wagner)
- in Spring of 2004 (David Wagner)
- in Spring of 2002 (Luca Trevisan, David Wagner)
- CS 278: Computational Complexity
- in Spring of 2021 (Avishay Tal)
- in Fall of 2016 (Prasad Raghavendra)
- in Spring of 2008 (Luca Trevisan)
- in Fall of 2004 (Luca Trevisan)
- in Fall of 2002 (Luca Trevisan)
- in Spring of 2001 (Luca Trevisan)
- CS 281B: Statistical Learning Theory
- in Spring of 2013 (Elchanan Mossel)
- CS 294: Lattices, Learning with Errors, and Post Quantum Cryptography
- in Spring of 2020 (Vinod Vaikuntanathan)
- CS 294: Graph Partitioning, Expanders and Spectral Methods
- in Spring of 2016 (Luca Trevisan)
- CS 294: Recent Advances in Approximability
- in Fall of 2012 (Prasad Raghavendra)
- CS 294: Evolution and Computation
- in Spring of 2014 (Christos Papadimitriou)
- in Spring of 2010 (Christos Papadimitriou)
- CS 294: Markov Chain Monte Carlo
- in Fall of 2009 (Alistair Sinclair)
- CS 294: Theoretical Computer Science’s Greatest Hits
- in Spring of 2016 (Prasad Raghavendra)
- CS 294: Mesh Generation and Geometry Processing in Graphics, Engineering, and Modeling
- in Spring of 2012 (Jonathan Shewchuk)
- in Spring of 2008 (Jonathan Shewchuk)
- in Fall of 1999 (Jonathan Shewchuk)
- CS 294: Sketching Algorithms
- in Fall of 2020 (Jelani Nelson)
- CS 294: Law and Cryptography
- in Fall of 2019 (Frank Partnoy, Shafi Goldwasser)
- in Fall of 2018 (Shafi Goldwasser)
- CS 294: Beyond Worst Case Analysis
- in Fall of 2017 (Luca Trevisan)
- CS 294: PCP and Hardness of Approximation
- in Spring of 2006 (Luca Trevisan)
- CS 294: Pseudorandomness
- in Fall of 2005 (Luca Trevisan)
- CS 294: Coding Theory
- in Fall of 2017 (Tom Gur, Igor Shinkar)
- CS 294: Coding Theory and Complexity
- in Fall of 2003 (Luca Trevisan)
- CS 294: Fourier Transforms and Theoretical Computer Science
- in Spring of 1999 (Umesh Vazirani)
- CS 294: Current Topics in Computational Biology
- in Fall of 2012 (Yun Song)
- CS 294: Sum of Squares: Proofs and Algorithms
- in Fall of 2018 (Prasad Raghavendra)
- CS 294: Partition Functions: Algorithms and Complexity
- in Fall of 2020 (Alistair Sinclair)
- CS 294: Special Topic in Cryptography: Secure Computation
- in Spring of 2016 (Sanjam Garg)
- CS 294: Advanced Cryptography
- in Spring of 2020 (Shafi Goldwasser and Vinod Vaikuntanathan)
- in Spring of 2018 (Sanjam Garg)
- CS 294: Foundations of Probabilistically Checkable Proofs
- in Fall of 2020 (Alessandro Chiesa)
- CS 294: Probabilistically Checkable and Interactive Proof Systems
- in Spring of 2019 (Alessandro Chiesa)
- in Spring of 2017 (Alessandro Chiesa and Igor Shinkar)
- CS 294: Property Testing
- in Fall of 2016 (Alessandro Chiesa and Igor Shinkar)
- CS 294: Great Algorithms
- in Spring of 2006 (Richard Karp)
- CS 294: Pseudorandomness
- in Fall of 2021 (Avishay Tal)
- CS 294: Quantum Interactive Protocols
- in Spring of 2022 (Umesh Vazirani)
- CS 294-063: Social Choice and Networks
- in Fall of 2010 (Elchanan Mossel)
- CS 294-179: Network Structure and Epidemics
- in Fall of 2020 (Christian Borgs)
- CS 294-238: Zero Knowledge Proofs
- in Spring of 2023 (Shafi Goldwasser and Dawn Song)
- CS 294-2: Quantum Computation
- in Fall of 2019 (Umesh Vazirani)
- in Fall of 2016 (Umesh Vazirani)
- in Fall of 2011 (Umesh Vazirani)
- in Spring of 2009 (Umesh Vazirani)
- in Spring of 2007 (Umesh Vazirani)
- in Fall of 2004 (Umesh Vazirani)
- CS 294-204: Phase Transitions
- in Spring of 2021 (Christian Borgs)
- CS 294-226: Advances in Error-Correcting Codes
- in Fall of 2022 (Venkatesan Guruswami)
- CS 294-214: Efficient Algorithms and Computational Complexity in Statistics
- in Fall of 2022 (Prasad Raghavendra)
- CS 294-206: Intro to Research in Quantum Computation
- in Fall of 2021 (Umesh Vazirani)
- CS 294-236: Cryptography in a Quantum World
- in Spring of 2023 (Fermi Ma and Umesh Vazirani )
- CS 294-92: Analysis of Boolean Functions
- in Spring of 2023 (Avishay Tal)
- in Spring of 2020 (Avishay Tal)
- in Fall of 2013 (Gil Kalai)
- CS 294-P29: Seminar on Algorithmic Game Theory
- in Fall of 2011 (Christos Papadimitriou)
- in Fall of 2009 (Christos Papadimitriou)
- CS 298: Reading the Classics
- in Spring of 2014 (Christos Papadimitriou)
- in Fall of 2007 (Christos Papadimitriou)
- Stat 206A: Polynomials of Random Variables
- in Fall of 2005 (Elchanan Mossel)
- Stat 260: Stochastic Processes in Evolutionary Biology
- in Spring of 2019 (Yun Song)
- in Spring of 2015 (Yun Song)
- in Fall of 2011 (Yun Song)
The timetable for this semester's CS courses is here, and next semester's is here.