Terence Tao

Discret. Comput. Geom., December, 2023

2018

Some remarks on the lonely runner conjecture.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2018

2017

A Bound on Partitioning Clusters.

[BibT_eX]

[DOI]

Daniel Kane

Electron. J. Comb., 2017

Random matrices have simple spectrum.

[BibT_eX]

[DOI]

Van Vu

Comb., 2017

2015

Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2015

2014

Every odd number greater than 1 is the sum of at most five primes.

[BibT_eX]

[DOI]

Math. Comput., 2014

2013

Noncommutative sets of small doubling.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

A nilpotent Freiman dimension lemma.

[BibT_eX]

[DOI]

Emmanuel Breuillard

Ben Green

Eur. J. Comb., 2013

On Sets Defining Few Ordinary Lines.

[BibT_eX]

[DOI]

Ben Joseph Green

Discret. Comput. Geom., 2013

2012

Deterministic methods to find primes.

[BibT_eX]

[DOI]

Ernest Croot III

Harald Helfgott

Math. Comput., 2012

An Incidence Theorem in Higher Dimensions.

[BibT_eX]

[DOI]

József Solymosi

Discret. Comput. Geom., 2012

The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi.

[BibT_eX]

[DOI]

Comb., 2012

2011

Operator splitting for the KdV equation.

[BibT_eX]

[DOI]

Math. Comput., 2011

2010

The power of convex relaxation: near-optimal matrix completion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

A sharp inverse Littlewood-Offord theorem.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Testability and repair of hereditary hypergraph properties.

[BibT_eX]

[DOI]

Tim Austin

Random Struct. Algorithms, 2010

Smooth analysis of the condition number and the least singular value.

[BibT_eX]

[DOI]

Math. Comput., 2010

Sumset and Inverse Sumset Theory for Shannon Entropy.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Freiman's theorem for solvable groups.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2010

2009

Freiman's Theorem in Finite Fields via Extremal Set Theory.

[BibT_eX]

[DOI]

Ben Green

Comb. Probab. Comput., 2009

The sum-product phenomenon in arbitrary rings.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2009

The distribution of polynomials over finite fields, with applications to the Gowers norms.

[BibT_eX]

[DOI]

Ben Joseph Green

Contributions Discret. Math., 2009

2008

Product set estimates for non-commutative groups.

[BibT_eX]

[DOI]

Comb., 2008

2007

Szemerédi's Theorem.

[BibT_eX]

[DOI]

Ben Joseph Green

Scholarpedia, 2007

The condition number of a randomly perturbed matrix.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Structure and Randomness in Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Additive combinatorics.

[BibT_eX]

Cambridge studies in advanced mathematics 105, Cambridge University Press, ISBN: 978-0-521-85386-6, 2007

2006

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information.

[BibT_eX]

[DOI]

Justin K. Romberg

IEEE Trans. Inf. Theory, 2006

On random plus/minus 1 matrices: Singularity and determinant.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

A variant of the hypergraph removal lemma.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

A Quantitative Ergodic Theory Proof of Szemerédi's Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Szemerédi's regularity lemma revisited.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2006

Solving mathematical problems - a personal perspective.

[BibT_eX]

Oxford University Press, ISBN: 978-0-19-920560-8, 2006

2005

Decoding by linear programming.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On random pm 1 matrices: singularity and determinant.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Error Correction via Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

A Positive Proof of the Littlewood-Richardson Rule using the Octahedron Recurrence.

[BibT_eX]

[DOI]

Allen Knutson