Some of David Zuckerman's Invited Talks

List-Decoding Reed-Muller Codes over Small Fields, given at CMU, modified from version given at 2008 Banff Workshop on Analytic Tools in Computational Complexity, UC Berkeley, and IAS.
• Linear-Degree Extractors and the Inapproximability of Max Clique and Chromatic Number, modified from the version given at IBM/NYU/Columbia Theory Day, STOC 2006, and elsewhere.
• Deterministic Extractors for Small Space Sources, given at the 2006 Banff Workshop on Recent Advances in Computational Complexity (modified from version given at SIAM Conference on Discrete Mathematics 2006).
• Some Successes and Failures of Algebra in Constructing Extractors, given at the IPAM Workshop on Automorphic Forms, Group Theory and Graph Expansion
• Codes in Theoretical Computer Science, given at the DIMACS Workshop on Codes and Complexity
• Computational Complexity and Entropy, given at the DIMACS Workshop on Computational Complexity, Entropy, and Statistical Physics