Paul Beame is a Professor in the Department of Computer Science and Engineering at the University of Washington. Beame received his BSc in Mathematics in 1981, MSc in Computer Science in 1982, and PhD in Computer Science in 1987, all from the University of Toronto. He was a Postdoctoral Research Associate at MIT for the 1986-87 academic year and joined the University of Washington in 1987. Beame's research is concerned primarily with computational complexity. His main interest is in proving lower bounds on the resources needed for solving computational problems. Such topics include communication complexity, time-space tradeoff lower bounds, proof complexity, and data structures. In addition, Paul Beame is interested in problems related to formal reasoning and verification. He has worked on the application and extension of the techniques of symbolic model checking for the verification of software specifications.