-
Randomness Extraction: A Survey, given at
Rutgers University, 2012, modified from earlier versions given
at the Institute for Advanced Study, 2012,
and the IPAM Workshop
Mathematics of Information-Theoretic Cryptography, 2011.
-
Privacy Amplification and Non-Malleable Extractors Via Character
Sums,
given at UT Austin, modified from earlier versions given at
Rutgers University and Princeton University, 2011.
-
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
Last modified: April 18, 2011.