Articles under category:
Boolean Functions
 ToC Library Graduate Surveys 1 (2008) 20 pages A Brief Introduction to Fourier Analysis on the Boolean Cube
 Vol 12, Article 4 (pp 1-50) Majority is Stablest: Discrete and SoS by Anindya De, Elchanan Mossel, and Joe Neeman
 Vol 11, Article 16 (pp 403-412) [NOTE] Quantum Algorithm for Monotonicity Testing on the Hypercube by Aleksandrs Belovs and Eric Blais
 Vol 10, Article 3 (pp 55-75) [Boolean Spec Issue] Dimension-Free $L_2$ Maximal Inequality for Spherical Means in the Hypercube
 Vol 10, Article 2 (pp 27-53) A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions
 Vol 9, Article 29 (pp 889-896) [NOTE] [Boolean Spec Issue] Hypercontractivity Via the Entropy Method by Eric Blais and Li-Yang Tan
 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
 Vol 9, Article 20 (pp 653-663) Approximating the AND-OR Tree
 Vol 9, Article 18 (pp 593-615) [Boolean Spec Issue] Making Polynomials Robust to Noise
 Vol 9, Article 17 (pp 587-592) [NOTE] [Boolean Spec Issue] A Monotone Function Given By a Low-Depth Decision Tree That Is Not an Approximate Junta
 Vol 7, Article 11 (pp 155-176) Distribution-Free Testing for Monomials with a Sublinear Number of Queries by Elya Dolev and Dana Ron
 Vol 7, Article 10 (pp 147-153) [NOTE] The Influence Lower Bound Via Query Elimination by Rahul Jain and Shengyu Zhang
 Vol 7, Article 6 (pp 75-99) Testing Linear-Invariant Non-Linear Properties
 Vol 7, Article 4 (pp 45-48) [NOTE] Tight Bounds on the Average Sensitivity of k-CNF
 Vol 6, Article 4 (pp 81-84) [NOTE] Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
 Vol 5, Article 13 (pp 257-282) Optimal Cryptographic Hardness of Learning Monotone Functions
 Vol 5, Article 10 (pp 191-216) Distribution-Free Testing Lower Bound for Basic Boolean Functions