Presentations
Occasionally I give a presentation at a CS Department Seminar or Reading Group. I will usually post a copy of the slides or notes that I used for the presentation after I give the talk. I tend to only post the slides or notes for my most recent presentation and may remove them without notice after some time.
My most recent presentation was during the Complexity Seminar Sponsored by Dr. Bill Gasarch on September 30, 2009 where I presented a proof of a lower bound on the SAT (Satisfiability) problem. The result is in Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak. Here are my slides that I used during the presentation.