Some Constructions In The Inverse Spectral Theory Of Cyclic Groups. - Ben Green 001 (Comb. Probab. Comput., 2003)

Finite field models in additive combinatories. - Ben Green 001 (BCC, 2005)

Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs. - Ben Green 001 (Comb., 2005)

Szemerédi's Theorem. - Ben Joseph Green; Terence Tao (Scholarpedia, 2007)

The distribution of polynomials over finite fields, with applications to the Gowers norms. - Ben Joseph Green; Terence Tao (Contributions Discret. Math., 2009)

Freiman's Theorem in Finite Fields via Extremal Set Theory. - Ben Green 001; Terence Tao (Comb. Probab. Comput., 2009)

On (Not) Computing the Möbius Function Using Bounded Depth Circuits. - Ben Green 001 (Comb. Probab. Comput., 2012)

On Sets Defining Few Ordinary Lines. - Ben Joseph Green; Terence Tao (Discret. Comput. Geom., 2013)

Contractions and expansion. - Emmanuel Breuillard; Ben Green 001 (Eur. J. Comb., 2013)

A nilpotent Freiman dimension lemma. - Emmanuel Breuillard; Ben Green 001; Terence Tao (Eur. J. Comb., 2013)

The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk). - Ben J. Green (SoCG, 2015)

Counting sets with small sumset and applications. - Ben Green 001; Robert Morris 001 (Comb., 2016)

On the Chromatic Number of Random Cayley Graphs. - Ben Green 001 (Comb. Probab. Comput., 2017)

On the arithmetic Kakeya conjecture of Katz and Tao. - Ben Green 001; Imre Z. Ruzsa (Period. Math. Hung., 2019)

Extremal problems for GCDs. - Ben Green 001; Aled Walker (Comb. Probab. Comput., 2021)

Sumsets and entropy revisited. - Ben Green 001; Freddie Manners; Terence Tao (Random Struct. Algorithms, 2025)