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 (see current & 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 would like to inquire about postdoctoral fellowships with our group, click here.

- 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

- 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 194: Undergraduate Cryptography

- CS 270: Combinatorial Algorithms and Data Structures
- CS 271: Randomness and Computation
- CS 273: Foundations of Parallel and Distributed Systems
- CS 274: Computational Geometry
- CS 276: Cryptography
- CS 278: Computational Complexity
- CS 281B: Statistical Learning Theory
- CS 294: Beyond Worst Case Analysis
- CS 294: Theoretical Computer Science’s Greatest Hits
- CS 294: Graph Partitioning, Expanders and Spectral Methods
- CS 294: 老王的灯笼最新版下载
- CS 294: 老王2.2.0
- CS 294: Markov Chain Monte Carlo
- CS 294: Recent Advances in Approximability
- CS 294: Mesh Generation and Geometry Processing in Graphics, Engineering, and Modeling
- CS 294: Lattices, Learning with Errors, and Post Quantum Cryptography
- CS 294: Property Testing
- CS 294: Coding Theory
- CS 294: PCP and Hardness of Approximation
- CS 294: Pseudorandomness
- CS 294: Probabilistically Checkable and Interactive Proof Systems
- CS 294: Coding Theory and Complexity
- CS 294: Fourier Transforms and Theoretical Computer Science
- CS 294: Current Topics in Computational Biology
- CS 294: Advanced Cryptography
- CS 294: 【有片】寂寞人妻的午后时光 - 爱收集资源网:2021-4-29 · 1 老王灯笼清爽版v2.1.5 翻墙神器 2 【有片】寂寞人妻的午后时光 3 破解茄子视频 爱威奶免费看视频 4 安卓浅浅草莓视频最新版 ...
- CS 294: Special Topic in Cryptography: Secure Computation
- CS 294: Great Algorithms
- CS 294-063: Social Choice and Networks
- CS 294-2: Quantum Computation
- CS 294-92: 老王灯笼官方下载
- CS 294-P29: Seminar on Algorithmic Game Theory
- CS 298: Reading the Classics
- Stat 206A: Polynomials of Random Variables
- Stat 260: Stochastic Processes in Evolutionary Biology

The timetable for this semester's CS courses is here, and next semester's is here.

- Alessandro Chiesa
- Sanjam Garg
- 老王2.2.3
- Moritz Hardt
- Richard Karp
- Jelani Nelson
- 老王的灯笼最新版下载
- Satish Rao
- Barna Saha
- Jonathan Shewchuk
- Alistair Sinclair
- Yun Song
- Nikhil Srivastava
- Jacob Steinhardt
- Bernd Sturmfels
- Avishay Tal
- Umesh Vazirani

- Rotem Arnon-Friedman
- Adam Bouland
- Romain Gay
- Mohammad Hajiabadi
- Sam Hopkins
- Urmila Mahadev
- Reza Moazezzi
- Jonah Sherman
- Paris Syminelakis
- Prashant Vasudevan

- James Bartusek
- Lynn Chua
- Grace Dinh
- Arun Ganesh
- Tarun Kathuria
- Marc Khoury
- Seri Khoury
- Rachel Lawrence
- 老王2.2.0
- Yunchao Liu
- Jarrod Millman
- Sidhanth Mohanty
- Chinmay Nirkhe
- Orr Paradise
- Manuel Sabin
- Jonathan Shafer
- Nick Spooner
- Akshayaram Srinivasan
- Elizabeth Yang
- Morris Yau
- Fred Zhang

- Nima Anari
- Frank Ban
- Antonio Blanca
- Tobias Boelter
- Ma'ayan Bresler
- Brielin Brown
- 老王免费灯笼2.2.4
- Siu Man Chan
- 老王灯笼官方下载
- Paul Christiano
- James Cook
- Anindya De
- 老王灯笼官方下载
- Luqman Hodgkinson
- Fotis Iliopoulos
- Varun Kanade
- Jingcheng Liu
- Pasin Manurangsi
- Peihan Miao
- George Pierrakos
- Anupam Prakash
- Christos-Alexandros Psomas
- Aviad Rubinstein
- Aaron Schild
- Tselil Schramm
- Jarett Schwartz
- Sara Sheehan
- Seung Woo Shin
- Piyush Srivastava
- Isabelle Stanton
- 老王灯笼官方下载
- Di Wang
- Guoming Wang
- Tom Watson
- 老王灯笼官方下载
- Sam Wong
- Chris Wilkens
- Qiuyi Zhang