Louis Clark Vanuxem Lectures Abstract
Lecture I: "Algorithms: a common language for nature, man and computer"
Lecture II: "Time, space and the cosmology of computational problems"
Lecture III: "Cryptography: secrets and lies, knowledge and trust"
"Kurt Gödel and Computer Science," a talk given at the Goedel Centenary at the IAS - November 17, 2006 Abstract
[ Video ]
"Kurt Gödel, von Neumann, and Theoretical Computer Science" a talk given at the 75th anniversary of the School of Mathematics at the IAS.
"Randomness Extractors - Applications and Constructions"
"Games computers (and computer scientists) play"
"The digital envelope - a crash course in modern cryptography"
"Depth through breadth (or why should we listen to talks in other areas)
"Zigzag product, expander constructions, connections and applications" (more applications than the survey below)
"Expander graphs - where combinatorics and algebra compete and cooperate" (more algebraic than the survey above) Abstract
"The art of reduction" Keynote lecture at FCRC, San Diego, CA - June 13, 2007 Abstract
"Proof, Computation and Randomness" at National Science Foundation, Arlington, VA - September 27, 2007. Abstract
"The PvsNP Problem" Public Lecture at the Institute for Advanced Study - October 24, 2008 Abstract
"The Art of Reduction (or Depth through Breadth)" Distinguished Lecturer Series at Penn State University, State College, PA - November 19, 2008 Abstract
"Randomness -- A computational complexity view" Logic Seminar at Penn State University, State College, PA - November 20, 2008
"Algebrization: A New Barrier in Complexity Theory" Theory Seminar, CS Department, UC Berkeley - November 5, 2008
"Seeded Randomness Extractors: applications and constructions" Princeton University Discrete Math Seminar - February 19, 2009
"Direct-product testing, and a new 2-query PCP" Theory Seminar, CS Department, Technion - Israel Institute of Technology, Haifa, Israel - March 1, 2009
"Les Valiant's Permanent Gift to Theoretical Computer Science" 60th Birthday Celebration, Bethesda, MD - May 30, 2009
"Theoretical Computer Science Methods in Asymptotic Geometry" Vitali Milman's 70th Birthday Celebration, Tel Aviv, Israel - June 24, 2009
"Quarter-century of proofs of the XOR lemma" (skeleton of a lecture)
"Direct product testing, parallel repetition and foams" Analytical Methods in Combinatorics, Additive Number Theory and Computer Science Workshop, IPAM, UCLA - December 1-4, 2009
"Expanders, Groups and Representations" Laci Babai's 60th Birthday Celebration, Columbus, OH - March 21-25, 2010
"Expander graphs - applications and combinatorial constructions" A 3-hour tutorial, Pseudorandomness in Mathematical Structures Workshop, IAS, Princeton, NJ - June 14-18, 2010
"The power and weakness of randomness (when you are short on time)" Abstract
"Szemeredi and TCS" Endre Szemeredi's 70th birthday conference, Budapest, August 2-6, 2010
Restriction Access A talk given at the Analysis of Algorithms 2012