


default search action
Ben Green 0001
Person information
- affiliation: Radcliffe Observatory Quarter, Mathematical Institute, Oxford, UK
Other persons with the same name
- Ben Green 0002
— University of Michigan, Ann Arbor, USA (and 1 more)
- Ben Green 0003 — University of London, Royal Holloway, Psychology Department, Egham, UK
- Ben Green 0004 — University of Michigan, School of Public Policy, Ann Arbor, MI, USA
- Ben Green 0005 — Portsmouth Hospitals NHS Trust, UK
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]Ben Green
, Freddie Manners, Terence Tao:
Sumsets and entropy revisited. Random Struct. Algorithms 66(1) (2025) - 2021
- [j13]Ben Green, Aled Walker
:
Extremal problems for GCDs. Comb. Probab. Comput. 30(6): 922-929 (2021)
2010 – 2019
- 2019
- [j12]Ben Green
, Imre Z. Ruzsa:
On the arithmetic Kakeya conjecture of Katz and Tao. Period. Math. Hung. 78(2): 135-151 (2019) - 2017
- [j11]Ben Green:
On the Chromatic Number of Random Cayley Graphs. Comb. Probab. Comput. 26(2): 248-266 (2017) - 2016
- [j10]Ben Green, Robert Morris:
Counting sets with small sumset and applications. Comb. 36(2): 129-159 (2016) - 2015
- [c2]Ben J. Green:
The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk). SoCG 2015: 405-405 - 2013
- [j9]Ben Joseph Green, Terence Tao:
On Sets Defining Few Ordinary Lines. Discret. Comput. Geom. 50(2): 409-468 (2013) - [j8]Emmanuel Breuillard, Ben Green, Terence Tao:
A nilpotent Freiman dimension lemma. Eur. J. Comb. 34(8): 1287-1292 (2013) - [j7]Emmanuel Breuillard, Ben Green:
Contractions and expansion. Eur. J. Comb. 34(8): 1293-1296 (2013) - 2012
- [j6]Ben Green:
On (Not) Computing the Möbius Function Using Bounded Depth Circuits. Comb. Probab. Comput. 21(6): 942-951 (2012)
2000 – 2009
- 2009
- [j5]Ben Joseph Green, Terence Tao:
The distribution of polynomials over finite fields, with applications to the Gowers norms. Contributions Discret. Math. 4(2) (2009) - [j4]Ben Green, Terence Tao:
Freiman's Theorem in Finite Fields via Extremal Set Theory. Comb. Probab. Comput. 18(3): 335-355 (2009) - 2007
- [j3]Ben Joseph Green, Terence Tao:
Szemerédi's Theorem. Scholarpedia 2(7): 3446 (2007) - 2005
- [j2]Ben Green:
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs. Comb. 25(3): 307-326 (2005) - [c1]Ben Green:
Finite field models in additive combinatories. BCC 2005: 1-27 - 2003
- [j1]Ben Green:
Some Constructions In The Inverse Spectral Theory Of Cyclic Groups. Comb. Probab. Comput. 12(2): 127-138 (2003)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint