- Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
- arXiv:0904.4193v2[cs.GT]24Aug2009 On the Power of Randomization in Algorithmic Mechanism Design
- Tight Bounds for Clock Synchronization [Extended Abstract]
- Twice-Ramanujan Sparsifiers Joshua Batson
- Hardness of Max-2Lin and Max-3Lin over integers, reals, and large cyclic Ryan O'Donnell
- Fully Homomorphic Encryption Using Ideal Lattices Craig Gentry
- The Convergence of Bird Flocking Bernard Chazelle
- On the Fourier tails of bounded functions over the discrete cube
- Composition of low-error 2-query PCPs using decodable PCPs Prahladh Harsha
- arXiv:0902.3583v1[math.CO]20Feb2009 A Better Algorithm for Random k-SAT
- Intrinsic Robustness of the Price of Anarchy Tim Roughgarden
- Extremal properties of polynomial threshold functions Ryan O'Donnell
- QIP = PSPACE Rahul Jain Zhengfeng Ji Sarvagya Upadhyay John Watrous
- 3-Bit Dictator Testing: 1 vs. 5/8 Ryan O'Donnell
- Sharpness of KKL on Schreier graphs Ryan O'Donnell and Karl Wimmer
- arXiv:0806.1978v5[cs.DS]8Dec2008 Max Cut and the Smallest Eigenvalue
- k+ DECISION TREES JAMES ASPNES 1
- Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions
- Spherical Cubes and Rounding in High Dimensions Guy Kindler
- Approximation by DNF: Examples and Counterexamples Ryan O'Donnell
- The Fourier EntropyInfluence Conjecture for certain classes of Boolean functions
- THE CHOW PARAMETERS PROBLEM RYAN O'DONNELL AND ROCCO A. SERVEDIO
- Higher eigenvalues of graphs Jonathan A. Kelner
- Inapproximability for VCG-Based Combinatorial Auctions Dave Buchfuhrer
- Learning Monotone Functions from Random Examples in Polynomial Time
- How to Round Any CSP Prasad Raghavendra, David Steurer,
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- 3-Query Locally Decodable Codes of Subexponential Length Klim Efremenko
- arXiv:0811.4413v5[cs.LG]19Aug2009 A Spectral Algorithm for Learning Hidden Markov Models
- PAC Learning Mixtures of Gaussians with No Separation Assumption
- Noise stability of functions with low influences: invariance and optimality
- Lower bounds for testing function isomorphism Eric Blais Ryan O'Donnell
- RYAN O'DONNELL Curriculum vitae
- Testing Halfspaces Kevin Matulef
- Small-size -Nets for Axis-Parallel Rectangles and Boxes Boris Aronov
- arXiv:1011.2249v1[cs.DS]10Nov2010 Pareto Optimal Solutions for Smoothed Analysts
- arXiv:1001.1593v1[cs.CC]11Jan2010 Fooling Functions of Halfspaces under Product Distributions
- Optimal lower bounds for locality sensitive hashing (except when q is tiny)
- A new proof of the density Hales-Jewett theorem D. H. J. Polymath
- Testing 1-Weight Halfspaces Kevin Matulef1
- KKL, Kruskal-Katona, and monotone nets Ryan O'Donnell
- Conditional Hardness for Satisfiable 3-CSPs Ryan O'Donnell
- Testing Fourier dimensionality and sparsity Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio,
- Some Topics in Analysis of Boolean Functions Ryan O'Donnell
- Polynomial regression under arbitrary product distributions Eric Blais and Ryan O'Donnell and Karl Wimmer
- Noise stability of functions with low influences: invariance and optimality
- Computational Applications Of Noise Sensitivity Ryan William O'Donnell
- Learning DNF from Random Walks Nader Bshouty
- New degree bounds for polynomial threshold functions Ryan O'Donnell
- Learning juntas Elchanan Mossel
- arXiv:0908.0375v1[cs.DS]4Aug2009 Deterministic Algorithms for the Lovasz Local Lemma
- Poly-logarithmic independence fools AC0 Mark Braverman
- Regularity Lemmas and Combinatorial Algorithms Nikhil Bansal
- The Intersection of Two Halfspaces Has High Threshold Degree
- kernel for feedback vertex set Stephan Thomasse
- Breaking the Multicommodity Flow Barrier for log n)-Approximations to Sparsest Cut
- The Monotone Complexity of k-Clique on Random Graphs Benjamin Rossman
- Distribution-Specific Agnostic Boosting Vitaly Feldman
- 15-855: Computational Complexity January 12, 2009 Eric Blais1
- On the noise sensitivity of monotone functions Elchanan Mossel
- arXiv:0910.3926v2[math.CO]16Feb2010 A NEW PROOF OF THE DENSITY HALES-JEWETT THEOREM
- Gaussian Noise Sensitivity and Fourier Tails Guy Kindler
- A new point of NP-hardness for Unique Games (extended abstract; full version begins on page 13)
- Linear programming, width-1 CSPs, and robust satisfaction Ryan O'Donnell
