default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErnie Croot
Person information
- affiliation: Georgia Institute of Technology, Department of Mathematics, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Gagik Amirkhanyan, Albert Bush, Ernie Croot:
Order-Preserving Freiman Isomorphisms. Integers 18: A8 (2018)- 2017
- [j13]Gagik Amirkhanyan, Albert Bush, Ernest Croot III, Chris Pryby:
Sets of rich lines in general position. J. Lond. Math. Soc. 96(1): 67-85 (2017) - 2013
- [j12]Ernie Croot, Izabella Laba, Olof Sisask:
Arithmetic Progressions in Sumsets and Lp -Almost-Periodicity. Comb. Probab. Comput. 22(3): 351-365 (2013) - [j11]Ernest Croot III, Kai Huang:
Threshold results for the inventory cycle offsetting problem. Int. J. Math. Oper. Res. 5(2): 255-281 (2013) - 2012
- [j10]Ernie Croot:
Some Properties of Lower Level-Sets of Convolutions. Comb. Probab. Comput. 21(4): 515-530 (2012) - [j9]Terence Tao, Ernest Croot III, Harald Helfgott:
Deterministic methods to find primes. Math. Comput. 81(278): 1233-1246 (2012) - 2011
- [j8]Spencer Backman, Ernie Croot, Mariah Hamel, Derrick Hart:
Sum-Product Inequalities With Perturbation. Integers 11A: Article3 (2011) - [j7]Evan Borenstein, Ernie Croot:
On a Certain Generalization of the Balog-Szemerédi-Gowers Theorem. SIAM J. Discret. Math. 25(2): 685-694 (2011) - 2010
- [j6]Ernie Croot:
On the Structure of Sets with Few Three-Term Arithmetic Progressions. Electron. J. Comb. 17(1) (2010) - [j5]Evan Borenstein, Ernie Croot:
On Rich Lines in Grids. Discret. Comput. Geom. 43(4): 824-840 (2010) - [j4]Ernie Croot, Derrick Hart:
h-Fold Sums from a Set with Few Products. SIAM J. Discret. Math. 24(2): 505-519 (2010)
2000 – 2009
- 2008
- [c1]Ernie Croot, Andrew Granville
, Robin Pemantle, Prasad Tetali:
Running Time Predictions for Factoring Algorithms. ANTS 2008: 1-36 - 2006
- [j3]Ernie Croot:
Long arithmetic progressions in critical sets. J. Comb. Theory A 113(1): 53-66 (2006) - [j2]Scott Contini, Ernie Croot, Igor E. Shparlinski:
Complexity of inverting the Euler function. Math. Comput. 75(254): 983-996 (2006) - 2004
- [j1]Ernie Croot, Ren-Cang Li, Hui June Zhu:
The abc conjecture and correctly rounded reciprocal square roots. Theor. Comput. Sci. 315(2-3): 405-417 (2004) - [i2]Scott Contini, Ernie Croot, Igor E. Shparlinski:
Complexity of Inverting the Euler Function. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [i1]Ernie Croot:
Memory Efficient Arithmetic. CoRR math.NT/0302315 (2003)
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 2025-01-09 13:23 CET 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:
