# Talks/Slides

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 I gave on Mar 15, 2014 at the Indiana Academy of Sciences in Indianapolis. The goal of the talk was to give an overview of the records for largest known primes, and a touch of the computation that goes into these computer searches. The intended audience is people who are interested in the topic (fairly broad).

PDF.A talk I gave on Nov 23, 2013 at Midwest Theory Day at Indiana University, Bloomington. The goal of the talk was to give an overview of the techniques and theorems used in computational searches for the largest (provably) known prime numbers. The intended audience is math and CS graduate students and faculty.

PDF.A talk I gave on Feb 4, 2013 at Capital University, Feb 14, 2013 at Ohio Northern University, and April 17 at Indiana State University. The goal of the talk was to introduce some research topics in the area of randomized algorithms and derandomization through some examples and considering the best algorithms known for primality testing. The intended audience was math and CS students.

PPTX.A talk at ISU as part of a panel discussion on undergraduate research, on October 3, 2012 and October 9, 2012. The goal of the talk is to share my experiences with undergraduate research - as it applies to Math and CS students at ISU. The audience was an interdisciplinary group of faculty.

PDF.A talk for the ISU Math and CS Department Seminar on March 21, 2012. The goal of the talk was to give an overview of some of the important results in lower bounds in theory of computing. For many problems, we think they are intractable (require exponential time to solve), but this has not been proved yet. This talk looks at some things that are known. At the end is a mention of my own work in this area, but that is not the focus of the talk.

PDF.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).