This page contains links to slides for presentations I have given. Slides for research presentations aimed at theory of computing researchers are linked from my publications page. This page contains slides for talks aimed at a wider audience.
A talk for the Rose Hulman Institute of Technology Mathematics Seminar on April 27, 2011. The goal with the talk was to give a flavor of the problems looked at within computational complexity, how the problems are posed, some interesting results and open questions, ... The talk is aimed at a general audience with some knowledge of math and computer science.
The Joy of Computational Complexity (google doc)A series of two talks on (1) an algebraic version of the P versus NP problem and (2) connections between obtaining algorithms for polynomial identity testing and lower bounds against algebraic P. These talks were given for the ISU Math and CS department seminar on February 11 and 25, 2011. The talk is aimed at a general audience who has some knowledge of math and computer science.
Algebraic P versus NP (PPTx).A talk I gave on the P versus NP problem for the Wabash College Math and CS department colloquium on November 16, 2010. The talk is aimed at a general audience who has some knowledge of computer science.
P versus NP (PPT).My "job talk" that I gave at Indiana State when I was applying for the job. This describes my research within the context of some of the major open questions in computer science. The intended audience is people with some knowledge of computer science.
ISU Job talk (PDF).Hot topics on theory of computing. This talk, given in March of 2009, was given to a group of graduate students at UW-Madison who were on the job market. The idea was to give some flavor about what some of the topics are that theory researchers currently work on.
Hot Topics in Theory (PDF).