additive combinatorics and computational complexity

This work is supported by NSF under grant CCF-0729137.

slides

research papers

expository papers

 

other writings

Expository notes on additive combinatorics and on pseudorandomness, expanders and regularity lemmas.

teaching

The Princeton Minicourse on additive combinatorics and computer science, August 2007

A Berkeley graduate course on additive combinatorics and computer science is tentatively planned for Spring 2010