- May 20, 2011 Dissertation Defense
- EC 2010: Computation and Incentives in Public Projects
- UW Theory Seminar Spring 2010: Computation and Incentives in Public Projects
- Candidacy Talk: Truth and Complexity in Allocation Games
- SODA 2010: Inapproximability for VCG-Based Combinatorial Auctions
- SISL Lunch Talk: A Combinatorial Look at Auctions
- NEGT 2009 Poster: Inapproximability of VCG-Based Auction Mechanisms
- 2009 Caltech Theory Group Talk: Computational Complexity and Truth in Auctions
- ISAAC 2008: The complexity of SPP formula minimization
- ICALP 2008: The complexity of Boolean formula minimization
- 2007 Caltech Theory Group Talk: The Complexity of Minimum Equivalent Formula