
Additive Combinatorics with a view towards Computer Science and Cryptography An
– Khodakhast Bibak
 2011

4

What is good mathematics
– Terence Tao
 2007

12

The ergodic and combinatorial approaches to Szemerédi’s theorem
– Terence Tao
 2006

34

A quantitative ergodic theory proof of Szemerédi’s theorem
– Terence Tao
 2004


An inverse theorem for the Gowers U³(G) norm
– Ben Green, Terence Tao
 2006

5

A simple regularization of hypergraphs
– Yoshiyasu Ishigami


Convergence of multiple . . .
– BERNARD HOST
 2006

21

A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, preprint
– Terence Tao

5

Obstructions to uniformity, and arithmetic patterns in the primes, preprint
– Terence Tao

5

DECOMPOSITIONS, APPROXIMATE STRUCTURE, TRANSFERENCE, AND THE HAHNBANACH THEOREM
– W. T. Gowers
 2008

47

A variant of the hypergraph removal lemma
– Terence Tao
 2006

3

Finding Large Sets Without Arithmetic Progressions of Length Three: An Empirical View and Survey II
– William Gasarch, James Glenn , Clyde P. Kruskal
 2010

2

ON A TWO–DIMENSIONAL ANALOG OF SZEMER ÉDI’S THEOREM IN ABELIAN GROUPS
– I. D. Shkredov
 705

34

Norm convergence of multiple ergodic averages for commuting transformations
– Terence Tao
 2007


On sets of integers not containing long arithmetic progressions
– Izabella Łaba, Michael T. Lacey
 2001


Finding Large 3free Sets I: The Small n Case
– William Gasarch A, James Glenn B, Clyde P. Kruskal C

4

Finding Large 3free Sets I: The Small n Case
– William Gasarch , James Glenn , Clyde P. Kruskal
 2007

3

Arithmetic progressions and the primes  El Escorial lectures
– Terence Tao

17

A new proof of the density HalesJewett theorem
– D. H. J. Polymath
 2009
