2. A. Wigderson

A review of Scott Aaronson's "Quantum Computing Since Democritus"

To appear in the Notices November, 2014

3. X. Chen, N. Kayal, A. Wigderson

Partial Derivatives in Arithmetic Complexity and Beyond

Foundations and Trends in Theoretical Computer Science (FTTCS), vol. 6, no. 1-2, pp. 1-138

4. A. Wigderson

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.

5. A. Wigderson

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.

7. A. Wigderson

Randomness and Pseudorandomness

A popular article published in the "Institute Letter," Summer 2009.

8. A. Wigderson

Randomness Extractors (lecture notes)

Pseudorandomness Mini-Workshop, 2008. Scribe: Zeev Dvir.

9. A. Wigderson

P, NP and Mathematics - A computational complexity perspective

Proceedings of the ICM 06 (Madrid), vol. 1, EMS Publishing House, Zurich, pp. 665-712, 2007.

10. S. Hoory, N. Linial, A. Wigderson

Expander Graphs and their Applications

Bull. Amer. Math Soc., 43, pp 439-561, 2006.

11. M. Luby, A. Wigderson

Pairwise Independence and Derandomization

Foundation and Trends in Theoretical Computer Science, vol. 1, no. 4, pp. 237-301, 2005.

14. A. Wigderson, S. Rudich

Computational Complexity Theory

Park City Mathematics Series, Vol 10, 2000.

15. A. Wigderson

Derandomizing BPP - Lecture notes of a Hebrew University course

Scribe: Ronen Shaltiel, 1998.