**[12]**On the Unique Games Conjecture.**[0]**Algorithmic Techniques and Tools from Computational Geometry.**[6]**Agnostically Learning Halfspaces.**[31]**Noise stability of functions with low in.uences invariance and optimality.**[5]**Every decision tree has an in.uential variable.**[1]**Lower Bounds for the Noisy Broadcast Problem.**[43]**The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l_{1}.**[6]**The Closest Substring problem with small distances.**[2]**Fitting tree metrics: Hierarchical clustering and Phylogeny.**[15]**Metric Embeddings with Relaxed Guarantees.**[10]**Nonembeddability theorems via Fourier analysis.**[7]**On the Complexity of Two-PlayerWin-Lose Games.**[12]**Nash Equilibria in Random Games.**[8]**Query Incentive Networks.**[9]**Sink Equilibria and Convergence.**[10]**On the Complexity of Real Functions.**[2]**Linear Lower Bounds on Real-World Implementations of Concurrent Objects.**[1]**Towards a Final Analysis of Pairing Heaps.**[16]**Structuring labeled trees for optimal succinctness, and beyond.**[12]**Approximation Algorithms for Unique Games.**[5]**On Non-Approximability for Quadratic Programs.**[4]**Hardness of Approximating the Closest Vector Problem with Pre-Processing.**[15]**Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.**[4]**A Recursive Greedy Algorithm for Walks in Directed Graphs.**[3]**Approximation Algorithms for Scheduling on Multiple Machines.**[26]**AdWords and Generalized On-line Matching.**[1]**The Parking Permit Problem.**[15]**Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.**[38]**Error Correction via Linear Programming.**[0]**Error-Correcting Codes for Automatic Control.**[0]**Almost Orthogonal Linear Codes are Locally Testable.**[0]**On Delsarte's Linear Programming Bounds for Binary Codes.**[4]**Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method.**[6]**Improved Smoothed Analysis of the Shadow Vertex Simplex Method.**[13]**Sampling-based Approximation Algorithms for Multi-stage Stochastic.**[4]**How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.**[11]**Group-theoretic Algorithms for Matrix Multiplication.**[1]**Answering distance queries in directed graphs using fast matrix multiplication.**[4]**A Randomness-Efficient Sampler for Matrix-valued Functions and Applications.**[4]**Deterministic Extractors for Affine Sources over Large Fields.**[7]**Additive Approximation for Edge-Deletion Problems.**[20]**A Characterization of the (natural) Graph Properties Testable with One-Sided Error.**[5]**An Algorithmic Version of the Hypergraph Regularity Method.**[15]**Cryptography In the Bounded Quantum-Storage Model.**[11]**Quantum Information and the PCP Theorem.**[22]**From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups.**[15]**The Symmetric Group Defies Strong Fourier Sampling.**[1]**On Learning Mixtures of Heavy-Tailed Distributions.**[7]**Learning mixtures of product distributions over discrete domains.**[7]**A general lower bound for mixing of single-site dynamics on graphs.**[4]**Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion .**[9]**Safraless Decision Procedures.**[5]**How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation.**[10]**On the Impossibility of Obfuscation with Auxiliary Input.**[7]**Concurrent Non-Malleable Commitments.**[4]**The Complexity of Online Memory Checking.**[9]**Rational Secure Computation and Ideal Mechanism Design.**[14]**Truthful and Near-Optimal Mechanism Design via Linear Programming.**[12]**Mechanism Design via Machine Learning.**[9]**Beyond VCG: Frugality of Truthful Mechanisms.**[2]**An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs.**[16]**Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring.**[3]**A linear-time approximation scheme for planar weighted TSP.**[1]**A Tale of Two Dimensional Bin Packing.

Created by Piotr Indyk and Suresh Venkatasubramanian. Original idea by Michael Mitzenmacher.