CS Theory @ UW

Theory   |   CSE   |   MSR ALG   |   MSR ML+O   |   Courses   |   News
Theory   |   CSE   |   Courses   |   News  

Theory talks:

  [ earlier | later ]   [ google calendar ]   [ seminar recordings ]


Paul Beame

Computational complexity, proof complexity, and satisfiability

Kevin Jamieson

Optimization, experimental design, machine learning

Sham Kakade

Data science, optimization, statistics, machine learning

Anna Karlin

Algorithms and algorithmic game theory

James R. Lee

Algorithms, complexity, optimization, probability

Yin Tat Lee

Convex optimization, algorithms

Huijia (Rachel) Lin

Cryptography, security, complexity theory

Jamie Morgenstern

Machine learning, algorithmic game theory

Shayan Oveis Gharan

Algorithms, spectral graph theory, applied probability

Anup Rao

Complexity theory, communication complexity, information theory

Thomas Rothvoss

Discrete optimization and linear/integer programming

Stefano Tessaro

Cryptography, security, complexity theory, information theory

Robbie Weber

Graph algorithms

Affiliated Researchers

Zeyuan Allen-Zhu (MSR)

Machine learning, optimization, algorithms.

Sebastien Bubeck (MSR)

Machine learning, combinatorial statistics, stochastic and convex optimization.

Nikhil Devanur (MSR)

Fundamental algorithms and algorithmic game theory.

Maryam Fazel (UW EE)

Mathematical optimization, data analysis, and control theory.

Kamal Jain (Faira)

Developing new insights on commerce from a foundational perspective.

Sreeram Kannan (UW EE)

Information theory and computational biology.

Robin Kothari (MSR)

quantum algorithms and complexity theory

Janardhan Kulkarni (MSR)


Ilya Razenshteyn (MSR)

Algorithms for geometrically structured data.

Rekha Thomas (UW Math)

Optimization and computational algebra

Sergey Yekhanin (MSR)

Error correcting codes, complexity theory, combinatorics

Seattle TCS postdocs

Becca Hoberg (UW Math)

Algorithms, Linear and Integer Programming

Joseph Jaeger

Cryptography, security

Lalit Jain

Machine learning

Tianren Liu


Aaron Schild

Algorithms, spectral graph theory, optimization

Xiaorui Sun (MSR)

Algorithms, big data processing

Graduate students

Dorna Abdolazimi

Algorithms, spectral graph theory

Yuqing Ai

Algorithms, spectral graph theory, optimization

Jennifer Brennan

Machine learning, active learning

Binyi Chen

Cryptography, security

Sami Davies

Approximation algorithms, probabilistic combinatorics

Sally Dong

Algorithms, combinatorics

Farzam Ebrahimnejad

Algorithms, spectral graph theory

Ashrujit Ghoshal

Cryptography, security, complexity theory

Jeffrey Hon

Algorithms and complexity theory

Siddharth Iyer

Information theory, combinatorics

Haotian Jiang

Optimization, algorithms, convex geometry

Nathan Klein

Approximation algorithms, combinatorics

Daogao Liu

Stochastic optimization, algorithms

Kuikui Liu

Algorithms, Markov chains, high-dimensional geometry

Ji Luo

Cryptography, complexity theory

Swati Padmanabhan

Convex optimization

Victor Reis

Combinatorial and convex optimization

Ruoqi Shen

Algorithms, optimization

Pratik Soni


Oscar Sprumont

Complexity theory

Ewin Tang

Combinatorics, algorithms, quantum computing

Ben Terner


Xin Yang

Complexity, hardness reductions, impossbility results

Xihu Zhang

Cryptography, complexity theory

Xinzhi Zhang

Approximation algorithms, geometry of polynomials


Kira Goldner

Mechanism design, approximation algorithms, algorithmic game theory

Vincent Liew

Complexity, probability, quantum computing

Siva Ramamoorthy

Complexity theory, communication complexity

Cyrus Rashtchian

Complexity theory, communication complexity, and analysis of Boolean functions

Alireza Rezaei

Approximation algorithms, spectral graph theory

Mert Saglam

Computational complexity

Makrand Sinha

Communication complexity, circuit lower bounds, applications of information theory

Robbie Weber

Graph algorithms

Theory courses

UW Theory highlights

Shayan Oveis Gharan wins 2021 Presburger Award for Young Scientists from EATCS for his research on TSP.

Anna Karlin is elected to the National Academy of Sciences.

Anna Karlin, Nathan Klein, and Shayan Oveis Gharan win a best paper award at STOC 2021 for their work A (Slightly) Improved Approximation Algorithm for Metric TSP.

Rachel Lin and coauthors achieve `Crown Jewel’ of Cryptography for their work on Indistinguishability Obfuscation from Well-Founded Assumptions, and receive a best paper award at STOC 2021.

Haotian Jiang wins a best student paper award at SODA 2021 for his work on minimizing convex functions with integral minimizers.

Anup Rao and Amir Yehudayoff publish Communication Complexity and Applications, a modern take on this foundational topic.

Kuikui Liu, Shayan Oveis Gharan and coauthors win a best paper award at STOC 2019 for their work on counting bases of matroids.

Yin Tat Lee and coauthors win a best paper award at NeurIPS 2018 for their work on algorithms for distributed optimization.

Thomas Rothvoss wins the Fulkerson Prize for his work on the perfect matching polytope.

Shayan Oveis Gharan is named an ONR Young Investigator.

The students of the UW theory group had an impressive presence at SODA 2017. Becca Hoberg and Thomas Rothvoss demonstrate A Logarithmic Additive Integrality Gap for Bin Packing; Cyrus Rashtchian and Paul Beame prove new results on Massively Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube; Alireza Rezaei and Shayan Oveis Gharan develop new Approximation Algorithms for Finding Maximum Induced Expanders.

Thomas Rothvoss is named a Packard Fellow.

Shayan Oveis Gharan named one of the “10 Scientists to Watch” by Science News.

Amos Fiat, Kira Goldner, Anna Karlin, and Elias Koutsoupias characterize the optimal auction in the “FedEx setting”, further demonstrating the importance of “ironing” and LP duality in mechanism design.

Alireza Rezaei, Shayan, and Nima Anari design efficient MCMC algorithms for sampling from homogeneous strongly Rayleigh measures, a generalization of k-determinantal point processes.

Anup Rao wins the 2016 SIAM Outstanding Paper Prize for his work with Boaz Barak, Mark Braverman and Xi Chen on how to compress interactive communication.

Elaine Levey and Thomas show how the Lasserre SDP hierarchy can be used to design new approximation algorithms for the classical problem of min-makespan scheduling with precedence constraints.

Rong Ge, Qingqing Huang, and Sham Kakade design new efficient algorithms for learning mixtures of Gaussians in high dimensions.

Siva Ramamoorthy and Anup give new techniques to compress communication protocols when the amount of communication is asymmetric.

James R. Lee, Prasad Raghavendra, and David Steurer win a best paper award at STOC 2015 for proving the first super-polynomial lower bounds on semidefinite extension complexity.

By proving a generalization of the Kadison-Singer conjecture, Shayan Oveis Gharan and Nima Anari give an improved bound on the integrality gap of the classical Held-Karp relaxation for the Asymmetric Traveling Salesman Problem.

Thomas Rothvoss wins the best paper award at STOC 2014 for proving lower bounds on the extension complexity of the matching polytope. Lance Fortnow calls it the “complexity result of the year.”