Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture Hao Huang Noise Stability of Weighted Majority Yuval Peres Simple Constructions of Almost k-wise Independent Random Variables Noga Alon, Oded Goldreich, Johan Håstad, and René Peralta On the Fourier Spectrum of Monotone Functions Nader H. Bshouty and Christino Tamon Every decision tree has an influential variable Ryan O'Donnell, Michael Saks, Oded Schramm, and Rocco A. Servedio Every monotone graph property has a sharp threshold Ehud Friedgut and Gil Kalai Boolean functions whose Fourier transform is concentrated on the first two levels Ehud Friedgut, Gil Kalai, and Assaf Naor Constant depth circuits, Fourier transform, and learnability Nathan Linial, Yishay Mansour, and Noam Nisan Noise Sensitivity of Boolean Functions and Applications to Percolation Itai Benjamini, Gil Kalai, and Oded Schramm Influences in Product Spaces: KKL and BKKKL Revisited Ehud Friedgut Bounded-width polynomial-size branching programs recognize exactly those languages in NC^1 David A. Barrington Linear programming bounds for codes via a covering argument Michael Navon and Alex Samorodnitsky An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean Function John Chiarelli, Pooya Hatami, Michael Saks A Szemeredi-type regularity lemma in abelian groups, with applications (Sections 1 and 2 only) Ben Green On the Power of Quantum Computation Daniel R. Simon The One-Way Communication Complexity of the Boolean Hidden Matching Problem Iordanis Kerenidis, Ran Raz Testing Booleanity and the Uncertainty Principle Tom Gur, Omer Tamuz The List-Decoding Size of Fourier-Sparse Boolean Functions Ishay Haviv, Oded Regev Testing Juntas Nearly Optimally (focus only on the boolean function, uniform distribution case) Eric Blais Fourier Sparsity and Dimension Swagato Sanyal