极光官方vnp网页版

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.

极光官方vnp网页版

• 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

极光官方vnp网页版

极光官方vnp网页版

• 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

极光官方vnp网页版

• CS 270: Combinatorial Algorithms and Data Structures
  • in Spring of 2023 (Satish Rao)
  • in Spring of 2017 (Satish Rao)
  • in Spring of 2016 (Christos Papadimitriou)
  • in 老王的灯笼v2.2.9 (Satish Rao, Umesh Vazirani)
  • in 老王 2.2.8 (Satish Rao, Umesh Vazirani)
• CS 271: Randomness and Computation
  • in Spring of 2023 (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 2023 (Jonathan Shewchuk)
  • in Spring of 2015 (Jonathan Shewchuk)
  • in 老王的灯笼最新版下载 (Jonathan Shewchuk)
  • in Fall of 2009 (Jonathan Shewchuk)
  • in 老王灯笼官方下载 (Jonathan Shewchuk)
  • in Spring of 2005 (Jonathan Shewchuk)
  • in Spring of 2003 (Jonathan Shewchuk)
• CS 276: Cryptography
  • 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 老王的灯笼最新版下载 (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 Fall of 2016 (Prasad Raghavendra)
  • in Spring of 2008 (Luca Trevisan)
  • in 老王 2.2.8 (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: Beyond Worst Case Analysis
  • in Fall of 2017 (Luca Trevisan)
• CS 294: Theoretical Computer Science’s Greatest Hits
  • in Spring of 2016 (Prasad Raghavendra)
• CS 294: Graph Partitioning, Expanders and Spectral Methods
  • in Spring of 2016 (Luca Trevisan)
• CS 294: 老王的灯笼最新版下载
  • in Fall of 2023 (Frank Partnoy, Shafi Goldwasser)
  • in Fall of 2018 (Shafi Goldwasser)
• CS 294: 老王2.2.0
  • 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: Recent Advances in Approximability
  • in Fall of 2012 (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: Lattices, Learning with Errors, and Post Quantum Cryptography
  • in Spring of 2023 (Vinod Vaikuntanathan)
• CS 294: Property Testing
  • in Fall of 2016 (Alessandro Chiesa and Igor Shinkar)
• CS 294: Coding Theory
  • in Fall of 2017 (Tom Gur, Igor Shinkar)
• CS 294: PCP and Hardness of Approximation
  • in 老王 2.2.8 (Luca Trevisan)
• CS 294: Pseudorandomness
  • in Fall of 2005 (Luca Trevisan)
• CS 294: Probabilistically Checkable and Interactive Proof Systems
  • in Spring of 2023 (Alessandro Chiesa)
  • in 老王的灯笼v2.2.9 (Alessandro Chiesa and 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: Advanced Cryptography
  • in Spring of 2023 (Shafi Goldwasser and Vinod Vaikuntanathan)
  • in Spring of 2018 (Sanjam Garg)
• CS 294: 【有片】寂寞人妻的午后时光 - 爱收集资源网:2021-4-29 · 1 老王灯笼清爽版v2.1.5 翻墙神器 2 【有片】寂寞人妻的午后时光 3 破解茄子视频 爱威奶免费看视频 4 安卓浅浅草莓视频最新版 ...
  • in Fall of 2018 (Prasad Raghavendra)
• CS 294: Special Topic in Cryptography: Secure Computation
  • in Spring of 2016 (Sanjam Garg)
• CS 294: Great Algorithms
  • 冰箱APP官方版下载V3.12.2-冰箱手机版下载|冰箱安卓版 ...:2021-6-8 · 冰箱APP官方版下载V3.12.2- 把恶意软件全冻住 软件介绍: 应用太耗电？不如「冻」起来。冰箱 Ice Box，是禁止应用中最受欢迎，下载量最多的冻结 App，没有之一。为什么？因为五年如一日，冰箱只做「冻结」一件事 ...
• CS 294-063: Social Choice and Networks
  • in Fall of 2010 (Elchanan Mossel)
• CS 294-2: Quantum Computation
  • in Fall of 2023 (Umesh Vazirani)
  • in Fall of 2016 (Umesh Vazirani)
  • in Fall of 2011 (Umesh Vazirani)
  • in Spring of 2009 (Umesh Vazirani)
  • in 老王 2.2.8 (Umesh Vazirani)
  • in Fall of 2004 (Umesh Vazirani)
• CS 294-92: 老王灯笼官方下载
  • in Spring of 2023 (Avishay Tal)
  • in Fall of 2013 (Gil Kalai)
• CS 294-P29: Seminar on Algorithmic Game Theory
  • in 老王的灯笼v2.2.9 (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 2023 (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.

极光官方vnp网页版