Articles under category:
Fourier Analysis
ToC Library Graduate Surveys 6 (2015) 14 pages
An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
by Shachar Lovett
ToC Library Graduate Surveys 1 (2008) 20 pages
A Brief Introduction to Fourier Analysis on the Boolean Cube
by Ronald de Wolf
Vol 19, Article 1 (pp 1-48)
Sublinear-Time Computation in the Presence of Online Erasures
by Iden Kalemaj, Sofya Raskhodnikova, and Nithin Varma
Vol 16, Article 2 (pp 1-18)
Threshold Secret Sharing Requires a Linear-Size Alphabet
by Andrej Bogdanov, Siyao Guo, and Ilan Komargodski
Vol 15, Article 11 (pp 1-13)
Fourier Sparsity and Dimension
by Swagato Sanyal
Vol 15, Article 1 (pp 1-55)
Testing $k$-Monotonicity: The Rise and Fall of Boolean Functions
by Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer
Vol 13, Article 12 (pp 1-50) [APRX-RND14 Spec Issue]
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs
by Thomas Steinke, Salil Vadhan, and Andrew Wan
Vol 11, Article 18 (pp 445-469) [Boolean Spec Issue]
On some extensions of the FKN theorem
by Jacek Jendrej, Krzysztof Oleszkiewicz, and Jakub O. Wojtaszczyk
Vol 10, Article 15 (pp 389-419) [Boolean Spec Issue]
Tight Bounds for Monotone Switching Networks via Fourier Analysis
by Siu Man Chan and Aaron Potechin
Vol 10, Article 6 (pp 133-166)
The Need for Structure in Quantum Speedups
by Scott Aaronson and Andris Ambainis
Vol 10, Article 3 (pp 55-75) [Boolean Spec Issue]
Dimension-Free $L_2$ Maximal Inequality for Spherical Means in the Hypercube
by Aram W. Harrow, Alexandra Kolla, and Leonard J. Schulman
Vol 9, Article 23 (pp 703-757) [APRX-RND12 Spec Issue]
Circumventing $d$-to-$1$ for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four
by Cenny Wenner
Vol 9, Article 7 (pp 283-293)
Pseudorandomness for Width-2 Branching Programs
by Andrej Bogdanov, Zeev Dvir, Elad Verbin, and Amir Yehudayoff
Vol 8, Article 27 (pp 623-645)
Near-Optimal and Explicit Bell Inequality Violations
by Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf
Vol 7, Article 6 (pp 75-99)
Testing Linear-Invariant Non-Linear Properties
by Arnab Bhattacharyya, Victor Chen, Madhu Sudan, and Ning Xie
Vol 5, Article 3 (pp 69-82)
Unconditional Pseudorandom Generators for Low-Degree Polynomials
by Shachar Lovett
Vol 1, Article 7 (pp 119-148)
Query Efficient PCPs with Perfect Completeness
by Johan Håstad and Subhash Khot