default search action
Oliver Roche-Newton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Oliver Roche-Newton
, Elaine Wong
Convexity, Squeezing, and the Elekes-Szabó Theorem. Electron. J. Comb. 31(1) (2024) - 2022
- [j17]Brandon Hanson
Higher Convexity and Iterated Sum Sets. Comb. 42(1): 71-85 (2022) - [j16]Oliver Roche-Newton
Arcs in Fq2. Eur. J. Comb. 103: 103512 (2022) - [j15]Cosmin Pohoata, Oliver Roche-Newton
Four-term progression free sets with three-term progressions in all large subsets. Random Struct. Algorithms 60(4): 749-770 (2022) - 2021
- [j14]Oliver Roche-Newton
New Expander Bounds from Affine Group Energy. Discret. Comput. Geom. 66(2): 552-574 (2021) - [j13]Oliver Roche-Newton
Sums, Products, and Dilates on Sparse Graphs. SIAM J. Discret. Math. 35(1): 194-204 (2021) - 2020
- [j12]Mehdi Makhul
Constructions for the Elekes-Szabó and Elekes-Rónyai Problems. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j11]Oliver Roche-Newton
On the size of the set AA+A. J. Lond. Math. Soc. 99(2): 477-494 (2019) - 2018
- [j10]Oliver Roche-Newton, Ilya D. Shkredov, Arne Winterhof:
Packing Sets over Finite Abelian Groups. Integers 18: A38 (2018) - [c2]Oliver Roche-Newton
An Improved Bound for the Size of the Set A/A+A. SoCG 2018: 69:1-69:12 - 2017
- [j9]Antal Balog, Oliver Roche-Newton, Dmitry Zhelezov:
Expanders with Superquadratic Growth. Electron. J. Comb. 24(3): 3 (2017) - [j8]Brendan Murphy, Oliver Roche-Newton
Variations on the Sum-Product Problem II. SIAM J. Discret. Math. 31(3): 1878-1894 (2017) - 2016
- [j7]Brandon Hanson
On distinct perpendicular bisectors and pinned distances in finite fields. Finite Fields Their Appl. 37: 240-264 (2016) - [j6]Oliver Roche-Newton
If (A+A)/(A+A) is small, then the ratio set is large. J. Lond. Math. Soc. 93(1): 83-100 (2016) - 2015
- [j5]Antal Balog, Oliver Roche-Newton
New Sum-Product Estimates for Real and Complex Numbers. Discret. Comput. Geom. 53(4): 825-846 (2015) - [j4]Orit E. Raz, Oliver Roche-Newton
Sets with few distinct distances do not have heavy lines. Discret. Math. 338(8): 1484-1492 (2015) - [j3]Brendan Murphy, Oliver Roche-Newton
Variations on the Sum-Product Problem. SIAM J. Discret. Math. 29(1): 514-540 (2015) - [c1]Oliver Roche-Newton
A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set. SoCG 2015: 74-80 - 2013
- [j2]Timothy G. F. Jones, Oliver Roche-Newton
Improved bounds on the set A(A+1). J. Comb. Theory A 120(3): 515-526 (2013) - 2011
- [j1]Liangpan Li, Oliver Roche-Newton
An improved sum-product estimate for general finite fields. SIAM J. Discret. Math. 25(3): 1285-1296 (2011)
Coauthor Index
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 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: