Paul Beame is a faculty member in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. His research is in pure and applied computational complexity. A major focus of his research is in proving lower bounds on the resources needed for solving computational problems in areas such as proof complexity, communication complexity, time-space trade-off lower bounds, circuit complexity, and data structures. On the applied side, a significant focus of his research is on problems related to formal reasoning and SAT-solving, which includes applications of computational complexity in formal verification of software and hardware, in the study of databases, and in AI, particularly in knowledge representation, learning, and probabilistic inference.