Fetching the paper…
Reading the bibliography…
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science.
Spectral analysis of Boolean functions as a graph eigenvalue problem
Anna Bernasconi and Bruno Codenotti · 1999
Earlier work this paper cites.
A polynomial bound in Freiman’s theorem
Mei-Chu Chang · 2002
Earlier work this paper cites.
Arithmetic progressions in sumsets
Ben Green · 2002
Earlier work this paper cites.
Some constructions in the inverse spectral theory of cyclic groups
Ben Green · 2003
Earlier work this paper cites.
Spectral structure of sets of integers
Ben Green · 2004
Earlier work this paper cites.
Freiman’s theorem in an arbitrary abelian group
Ben Green and Imre Z. Ruzsa · 2007
Earlier work this paper cites.
Boolean functions with small spectral norm
Ben Green and Tom Sanders · 2008
Earlier work this paper cites.
Additive structures in sumsets
Tom Sanders · 2008
Earlier work this paper cites.
On the communication complexity of XOR functions
Ashley Montanaro and Tobias Osborne · 2009
Earlier work this paper cites.
Testing Fourier dimensionality and sparsity
Parikshit Gopalan, Ryan O’Donnell, Rocco A. Servedio, Amir Shpilka, and Karl Wimmer · 2011
Cited alongside, same era.
Variations on the sensitivity conjecture
Pooya Hatami, Raghav Kulkarni, and Denis Pankratov · 2011
Cited alongside, same era.
On Roth’s theorem on progressions
Tom Sanders · 2011
Cited alongside, same era.
Testing Booleanity and the uncertainty principle
Tom Gur and Omer Tamuz · 2013
Cited alongside, same era.
Fourier sparsity, spectral norm, and the log-rank conjecture
Hing Yin Tsang, Chung Hoi Wong, Ning Xie, and Shengyu Zhang · 2013
Cited alongside, same era.
Sampling-based proofs of almost-periodicity results and algorithmic applications
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, and Julia Wolf · 2014
Cited alongside, same era.
Approximate constraint satisfaction requires large LP relaxations
Siu On Chan, James R. Lee, Prasad Raghavendra, and David Steurer · 2016
Later among the works it cites.
Communication is bounded by root of rank
Shachar Lovett · 2016
Later among the works it cites.
Chvátal’s conjecture and correlation inequalities
Ehud Friedgut, Jeff Kahn, Gil Kalai, and Nathan Keller · 2018
Later among the works it cites.
Two new results about quantum exact learning
Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald de Wolf · 2019
Later among the works it cites.
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, and Avishay Tal · 2019
Later among the works it cites.
Optimality of linear sketching under modular updates
Kaave Hosseini, Shachar Lovett, and Grigory Yaroslavtsev · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An entropic proof of Chang’s inequality
Russell Impagliazzo, Cristopher Moore, and Alexander Russell · 2014
Cited alongside, same era.
A quantitative improvement for Roth’s theorem on arithmetic progressions
Thomas F Bloom · 2016
Cited alongside, same era.
Later among the works it cites.
Fourier sparsity and dimension
Swagato Sanyal · 2019
Later among the works it cites.
Breaking the logarithmic barrier in Roth’s theorem on arithmetic progressions
Thomas F Bloom and Olof Sisask · 2020
Closest in time.