Books and survey articles

On the interaction of TCS and Math
A review of Scott Aaronson's "Quantum Computing Since Democritus"
To appear in the Notices November, 2014
Partial Derivatives in Arithmetic Complexity and Beyond
Foundations and Trends in Theoretical Computer Science (FTTCS), vol. 6, no. 1-2, pp. 1-138
Lecture notes on Representation Theory of Finite Groups
Barbados meeting on Computational Complexity. This file also contains lectures notes of Ben Green on Additive Combinatorics, given at the same meeting.
The Gődel Phenomena in Mathematics: A Modern View
Included in Kurt Gődel and the Foundations of Mathematics: Horizons of Truth, eds. M. Baaz, C. Papadimitriou, H. Putnam, D. Scott, C. Harper, Cambridge University Press, to be published in 2010.
Knowledge, Creativity and P versus NP (a very informal draft)
Randomness and Pseudorandomness
A popular article published in the "Institute Letter," Summer 2009.
Randomness Extractors (lecture notes)
Pseudorandomness Mini-Workshop, 2008. Scribe: Zeev Dvir.
P, NP and Mathematics - A computational complexity perspective
Proceedings of the ICM 06 (Madrid), vol. 1, EMS Publishing House, Zurich, pp. 665-712, 2007.
Expander Graphs and their Applications
Bull. Amer. Math Soc., 43, pp 439-561, 2006.
Pairwise Independence and Derandomization
Foundation and Trends in Theoretical Computer Science, vol. 1, no. 4, pp. 237-301, 2005.
Arithmetic Complexity - A survey (lecture notes)
Scribe: Oded Regev, 2002.
Derandomizing BPP - A survey (lecture notes)
Scribe: Irit Dinur, 2002.
Computational Complexity Theory
Park City Mathematics Series, Vol 10, 2000.
Derandomizing BPP - Lecture notes of a Hebrew University course
Scribe: Ronen Shaltiel, 1998.