# UW Theory Faculty

## Paul Beame | bea...@cs.washington.edu

Computational complexity, primarily proving lower bounds on the resources needed for solving computational problems. Communication complexity, time-space tradeoff lower bounds, proof complexity, formal reasoning and verification.

## Anna Karlin | kar...@cs.washington.edu

Design and analysis of algorithms, particularly probabilistic and online algorithms. The interface between theory and other areas, such as economics and game theory, data mining, operating systems, networks, and distributed systems.

## Richard Ladner | lad...@cs.washington.edu

Data compression, cache performance of algorithms, algorithms for media-on-demand systems.

## James R. Lee | jrl...@cs.washington.edu

Algorithms, complexity, optimization. High-dimensional geometry, geometry of discrete metric spaces, spectral graph theory. Applications of geometry and analysis in theoretical computer science.

## Anup Rao | an...@cs.washington.edu

Pseudorandomness, Complexity, Coding Theory, Combinatorics.