About Stanford Theory
As theoretical computer scientists, we seek greater understanding of fundamental computational techniques and their inherent limitations. Research includes the development and analysis of algorithms for a variety of settings and applications. Major directions include Complexity Theory, Cryptography, Algorithmic Game Theory, Geometric Algorithms, algorithmic techniques for internet applications, various aspects of network and computer security, databases, design and analysis of programs and programming languages, and supporting studies in combinatorial, logical, and algebraic mathematics. Please see the research page for an overview of research in a sampling of areas, and refer to the faculty pages for specific research interests.
- Greg Valiant will be joining us as an assistant professor in Fall 2013!
- We recently started the Motwani lecture series in memory of our late colleague Rajeev Motwani, who has been an inspiration to generations of theory researchers.
- Stanford Theory Seminar
- We also have Theory Lunch talks every Thursday noon.
- Theory Reading Group is run by (and exclusively for) students. (Warning: extremely outdated. Contact Kevin Lewi for more up-to-date news on this...)
- The RAIN Seminar is dedicated to algorithms on the internet.