Derandomized dimensionality reduction with applications. - Lars Engebretsen; Piotr Indyk; Ryan O'Donnell (SODA, 2002)

Hardness amplification within NP. - Ryan O'Donnell (STOC, 2002)

Learning juntas. - Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (STOC, 2003)

On the noise sensitivity of monotone functions. - Elchanan Mossel; Ryan O'Donnell (Random Struct. Algorithms, 2003)

Learning intersections and thresholds of halfspaces. - Adam R. Klivans; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2004)

Learning functions of k relevant variables. - Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2004)

Hardness amplification within NP. - Ryan O'Donnell (J. Comput. Syst. Sci., 2004)

Noise stability of functions with low in.uences invariance and optimality. - Elchanan Mossel; Ryan O'Donnell; Krzysztof Oleszkiewicz (FOCS, 2005)

Every decision tree has an in.uential variable. - Ryan O'Donnell; Michael E. Saks; Oded Schramm; Rocco A. Servedio (FOCS, 2005)

Every decision tree has an influential variable - Ryan O'Donnell; Michael E. Saks; Oded Schramm; Rocco A. Servedio (CoRR, 2005)

Noise stability of functions with low influences: invariance and optimality - Elchanan Mossel; Ryan O'Donnell; Krzysztof Oleszkiewicz (CoRR, 2005)

Learning DNF from random walks. - Nader H. Bshouty; Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2005)

Coin flipping from a cosmic source: On error correction of truly random bits. - Elchanan Mossel; Ryan O'Donnell (Random Struct. Algorithms, 2005)

PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. - Jon Feldman; Rocco A. Servedio; Ryan O'Donnell (COLT, 2006)

SDP gaps and UGC-hardness for MAXCUTGAIN. - Subhash Khot; Ryan O'Donnell (FOCS, 2006)

On the fourier tails of bounded functions over the discrete cube. - Irit Dinur; Ehud Friedgut; Guy Kindler; Ryan O'Donnell (STOC, 2006)

PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption - Jon Feldman; Ryan O'Donnell; Rocco A. Servedio (CoRR, 2006)

Approximation by DNF: Examples and Counterexamples. - Ryan O'Donnell; Karl Wimmer (ICALP, 2007)

Understanding Parallel Repetition Requires Understanding Foams. - Uriel Feige; Guy Kindler; Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2007)

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. - Subhash Khot; Guy Kindler; Elchanan Mossel; Ryan O'Donnell (SIAM J. Comput., 2007)

Learning Monotone Decision Trees in Polynomial Time. - Ryan O'Donnell; Rocco A. Servedio (SIAM J. Comput., 2007)

Spherical Cubes and Rounding in High Dimensions. - Guy Kindler; Ryan O'Donnell; Anup Rao 001; Avi Wigderson (FOCS, 2008)

Learning Geometric Concepts via Gaussian Surface Area. - Adam R. Klivans; Ryan O'Donnell; Rocco A. Servedio (FOCS, 2008)

An optimal sdp algorithm for max-cut, and equally optimal long code tests. - Ryan O'Donnell; Yi Wu 002 (STOC, 2008)

Eliminating Cycles in the Discrete Torus. - Béla Bollobás; Guy Kindler; Imre Leader; Ryan O'Donnell (Algorithmica, 2008)

Some Topics in Analysis of Boolean Functions. - Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2008)

Extremal properties of polynomial threshold functions. - Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2008)

Learning Mixtures of Product Distributions over Discrete Domains. - Jon Feldman; Ryan O'Donnell; Rocco A. Servedio (SIAM J. Comput., 2008)

Testing ±1-weight halfspace. - Kevin Matulef; Ryan O'Donnell; Ronitt Rubinfeld; Rocco A. Servedio (APPROX-RANDOM, 2009)

3-bit dictator testing: 1 vs. 5/8. - Ryan O'Donnell; Yi Wu 002 (SODA, 2009)

Conditional hardness for satisfiable 3-CSPs. - Ryan O'Donnell; Yi Wu 002 (STOC, 2009)

Optimal lower bounds for locality sensitive hashing (except when q is tiny). - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (Electron. Colloquium Comput. Complex., 2009)

SDP Gaps and UGC-hardness for Max-Cut-Gain. - Subhash Khot; Ryan O'Donnell (Theory Comput., 2009)

k + Decision Trees - (Extended Abstract). - James Aspnes; Eric Blais; Murat Demirbas; Ryan O'Donnell; Atri Rudra; Steve Uurtamo (ALGOSENSORS, 2010)

Lower Bounds for Testing Function Isomorphism. - Eric Blais; Ryan O'Donnell (CCC, 2010)

SDP Gaps for 2-to-1 and Other Label-Cover Variants. - Venkatesan Guruswami; Subhash Khot; Ryan O'Donnell; Preyas Popat; Madhur Tulsiani; Yi Wu 002 (ICALP (1), 2010)

Testing (Subclasses of) Halfspaces. - Kevin Matulef; Ryan O'Donnell; Ronitt Rubinfeld; Rocco A. Servedio (Property Testing, 2010)

New degree bounds for polynomial threshold functions. - Ryan O'Donnell; Rocco A. Servedio (Comb., 2010)

Fooling functions of halfspaces under product distributions. - Yi Wu 002; Ryan O'Donnell; David Zuckerman; Parikshit Gopalan (Electron. Colloquium Comput. Complex., 2010)

Polynomial regression under arbitrary product distributions. - Eric Blais; Ryan O'Donnell; Karl Wimmer (Mach. Learn., 2010)

Testing Halfspaces. - Kevin Matulef; Ryan O'Donnell; Ronitt Rubinfeld; Rocco A. Servedio (SIAM J. Comput., 2010)

The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. - Ryan O'Donnell; John Wright 004; Yuan Zhou 007 (ICALP (1), 2011)

Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions. - Ilias Diakonikolas; Ryan O'Donnell; Rocco A. Servedio; Yi Wu 002 (SODA, 2011)

Testing Fourier Dimensionality and Sparsity. - Parikshit Gopalan; Ryan O'Donnell; Rocco A. Servedio; Amir Shpilka; Karl Wimmer (SIAM J. Comput., 2011)

The Chow Parameters Problem. - Ryan O'Donnell; Rocco A. Servedio (SIAM J. Comput., 2011)

A New Point of NP-Hardness for 2-to-1 Label Cover. - Per Austrin; Ryan O'Donnell; John Wright 004 (APPROX-RANDOM, 2012)

Gaussian Noise Sensitivity and Fourier Tails. - Guy Kindler; Ryan O'Donnell (CCC, 2012)

Linear programming, width-1 CSPs, and robust satisfaction. - Gábor Kun; Ryan O'Donnell; Suguru Tamaki; Yuichi Yoshida; Yuan Zhou 007 (ITCS, 2012)

A new point of NP-hardness for unique games. - Ryan O'Donnell; John Wright 004 (STOC, 2012)

Spherical cubes: optimal foams from computational hardness amplification. - Guy Kindler; Anup Rao 001; Ryan O'Donnell; Avi Wigderson (Commun. ACM, 2012)

Improved small-set expansion from higher eigenvalues - Ryan O'Donnell; David Witmer (CoRR, 2012)

Open Problems in Analysis of Boolean Functions - Ryan O'Donnell (CoRR, 2012)

Hypercontractive inequalities via SOS, with an application to Vertex-Cover - Manuel Kauers; Ryan O'Donnell; Li-Yang Tan; Yuan Zhou 007 (CoRR, 2012)

Pareto Optimal Solutions for Smoothed Analysts. - Ankur Moitra; Ryan O'Donnell (SIAM J. Comput., 2012)

Learning Sums of Independent Integer Random Variables. - Constantinos Daskalakis; Ilias Diakonikolas; Ryan O'Donnell; Rocco A. Servedio; Li-Yang Tan (FOCS, 2013)

A Composition Theorem for the Fourier Entropy-Influence Conjecture. - Ryan O'Donnell; Li-Yang Tan (ICALP (1), 2013)

Approximability and proof complexity. - Ryan O'Donnell; Yuan Zhou 007 (SODA, 2013)

KKL, Kruskal-Katona, and Monotone Nets. - Ryan O'Donnell; Karl Wimmer (SIAM J. Comput., 2013)

Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword. - Elchanan Mossel; Ryan O'Donnell (Theory Comput., 2013)

Analysis of Boolean Functions. - Ryan O'Donnell (Cambridge University Press, 2014)

Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. - Ryan O'Donnell; David Witmer (CCC, 2014)

A Composition Theorem for Parity Kill Number. - Ryan O'Donnell; John Wright 004; Yu Zhao 032; Xiaorui Sun; Li-Yang Tan (CCC, 2014)

One Time-traveling Bit is as Good as Logarithmically Many. - Ryan O'Donnell; A. C. Cem Say (FSTTCS, 2014)

Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. - Manuel Kauers; Ryan O'Donnell; Li-Yang Tan; Yuan Zhou 007 (SODA, 2014)

Testing Surface Area. - Pravesh Kothari; Amir Nayyeri; Ryan O'Donnell; Chenggang Wu 003 (SODA, 2014)

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs. - Ryan O'Donnell; John Wright 004; Chenggang Wu 003; Yuan Zhou 007 (SODA, 2014)

Social choice, computational complexity, Gaussian geometry, and Boolean functions. - Ryan O'Donnell (CoRR, 2014)

One time-travelling bit is as good as logarithmically many. - Ryan O'Donnell; A. C. Cem Say (Electron. Colloquium Comput. Complex., 2014)

Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010). - Lap Chi Lau; Tal Malkin; Ryan O'Donnell; Luca Trevisan 001 (SIAM J. Comput., 2014)

New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover. - Per Austrin; Ryan O'Donnell; Li-Yang Tan; John Wright 004 (ACM Trans. Comput. Theory, 2014)

How to Refute a Random CSP. - Sarah R. Allen; Ryan O'Donnell; David Witmer (FOCS, 2015)

Conditioning and covariance on caterpillars. - Sarah R. Allen; Ryan O'Donnell (ITW, 2015)

Optimal Bounds for Estimating Entropy with PMF Queries. - Cafer Caferov; Baris Kaya; Ryan O'Donnell; A. C. Cem Say (MFCS (2), 2015)

Algorithmic Signaling of Features in Auction Design. - Shaddin Dughmi; Nicole Immorlica; Ryan O'Donnell; Li-Yang Tan (SAGT, 2015)

Quantum Spectrum Testing. - Ryan O'Donnell; John Wright 004 (STOC, 2015)

Continuous analogues of the Most Informative Function problem. - Guy Kindler; Ryan O'Donnell; David Witmer (CoRR, 2015)

Beating the random assignment on constraint satisfaction problems of bounded degree. - Boaz Barak; Ankur Moitra; Ryan O'Donnell; Prasad Raghavendra; Oded Regev 001; David Steurer; Luca Trevisan 001; Aravindan Vijayaraghavan; David Witmer; John Wright 004 (Electron. Colloquium Comput. Complex., 2015)

Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (ACM Trans. Comput. Theory, 2015)

Polynomial Bounds for Decoupling, with Applications. - Ryan O'Donnell; Yu Zhao 032 (CCC, 2016)

Efficient quantum tomography. - Ryan O'Donnell; John Wright 004 (STOC, 2016)

Bounding laconic proof systems by solving CSPs in parallel. - Jason Li 006; Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2016)

SOS is not obviously automatizable, even approximately. - Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2016)

The weakness of CTC qubits and the power of approximate counting. - Ryan O'Donnell; A. C. Cem Say (Electron. Colloquium Comput. Complex., 2016)

Quantum Automata Cannot Detect Biased Coins, Even in the Limit. - Guy Kindler; Ryan O'Donnell (ICALP, 2017)

Optimal mean-based algorithms for trace reconstruction. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (STOC, 2017)

Sum of squares lower bounds for refuting any CSP. - Pravesh K. Kothari; Ryuhei Mori; Ryan O'Donnell; David Witmer (STOC, 2017)

Efficient quantum tomography II. - Ryan O'Donnell; John Wright 004 (STOC, 2017)

Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States (Shortened Version). - Ryan O'Donnell; John Wright 004 (SIGACT News, 2017)

Improved NP-Inapproximability for 2-Variable Linear Equations. - Johan Håstad; Sangxia Huang; Rajsekar Manokaran; Ryan O'Donnell; John Wright 004 (Theory Comput., 2017)

On Closeness to k-Wise Uniformity. - Ryan O'Donnell; Yu Zhao 032 (APPROX-RANDOM, 2018)

Learning sparse mixtures of rankings from noisy information. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (CoRR, 2018)

Fooling Polytopes. - Ryan O'Donnell; Rocco A. Servedio; Li-Yang Tan (Electron. Colloquium Comput. Complex., 2018)

Special Issue: CCC 2017: Guest Editor's Foreword. - Shachar Lovett; Ryan O'Donnell (Theory Comput., 2018)

A Log-Sobolev Inequality for the Multislice, with Applications. - Yuval Filmus; Ryan O'Donnell; Xinyu Wu (ITCS, 2019)

SOS Lower Bounds with Hard Constraints: Think Global, Act Local. - Pravesh K. Kothari; Ryan O'Donnell; Tselil Schramm (ITCS, 2019)

The threshold for SDP-refutation of random regular NAE-3SAT. - Yash Deshpande; Andrea Montanari; Ryan O'Donnell; Tselil Schramm; Subhabrata Sen (SODA, 2019)

Quantum state certification. - Costin Badescu; Ryan O'Donnell; John Wright 004 (STOC, 2019)

X-Ramanujan Graphs. - Sidhanth Mohanty; Ryan O'Donnell (CoRR, 2019)

Explicit near-fully X-Ramanujan graphs. - Ryan O'Donnell; Xinyu Wu (FOCS, 2020)

Lower Bounds for Testing Complete Positivity and Quantum Separability. - Costin Badescu; Ryan O'Donnell (LATIN, 2020)

X-Ramanujan graphs. - Sidhanth Mohanty; Ryan O'Donnell (SODA, 2020)

The SDP Value for Random Two-Eigenvalue CSPs. - Sidhanth Mohanty; Ryan O'Donnell; Pedro Paredes 002 (STACS, 2020)

Fooling Gaussian PTFs via local hyperconcentration. - Ryan O'Donnell; Rocco A. Servedio; Li-Yang Tan (STOC, 2020)

Fiber Bundle Codes: Breaking the N1/2 polylog(N) Barrier for Quantum LDPC Codes. - Matthew B. Hastings; Jeongwan Haah; Ryan O'Donnell (CoRR, 2020)

Sharp Bounds for Population Recovery. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (Theory Comput., 2020)

Editorial from the New Editor-in-Chief. - Ryan O'Donnell (ACM Trans. Comput. Theory, 2020)

Learning sparse mixtures of permutations from noisy information. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (COLT, 2021)

Quantum Approximate Counting with Nonadaptive Grover Iterations. - Ramgopal Venkateswaran; Ryan O'Donnell (STACS, 2021)

Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes. - Matthew B. Hastings; Jeongwan Haah; Ryan O'Donnell (STOC, 2021)

Fooling Gaussian PTFs via Local Hyperconcentration. - Ryan O'Donnell; Rocco A. Servedio; Li-Yang Tan; Daniel Kane 001 (CoRR, 2021)

Analysis of Boolean Functions. - Ryan O'Donnell (CoRR, 2021)

Pauli error estimation via Population Recovery. - Steven T. Flammia; Ryan O'Donnell (Quantum, 2021)

Sherali-Adams Strikes Back. - Ryan O'Donnell; Tselil Schramm (Adv. Math. Commun., 2021)

High-Dimensional Expanders from Chevalley Groups. - Ryan O'Donnell; Kevin Pratt (CCC, 2022)

Toward Instance-Optimal State Certification With Incoherent Measurements. - Sitan Chen; Jerry Li 001; Ryan O'Donnell (COLT, 2022)

The SDP Value of Random 2CSPs. - Amulya Musipatla; Ryan O'Donnell; Tselil Schramm; Xinyu Wu (ICALP, 2022)

Explicit Abelian Lifts and Quantum LDPC Codes. - Fernando Granha Jeronimo; Tushant Mittal; Ryan O'Donnell; Pedro Paredes 002; Madhur Tulsiani (ITCS, 2022)

The Quantum Union Bound made easy. - Ryan O'Donnell; Ramgopal Venkateswaran (SOSA, 2022)

Optimizing strongly interacting fermionic Hamiltonians. - Matthew B. Hastings; Ryan O'Donnell (STOC, 2022)

Explicit Near-Ramanujan Graphs of Every Degree. - Sidhanth Mohanty; Ryan O'Donnell; Pedro Paredes 002 (SIAM J. Comput., 2022)

Query-optimal estimation of unitary channels in diamond distance. - Jeongwan Haah; Robin Kothari; Ryan O'Donnell; Ewin Tang (FOCS, 2023)

Explicit orthogonal and unitary designs. - Ryan O'Donnell; Rocco A. Servedio; Pedro Paredes 002 (FOCS, 2023)

Mean estimation when you have the source code; or, quantum Monte Carlo methods. - Robin Kothari; Ryan O'Donnell (SODA, 2023)

Coboundary expansion inside Chevalley coset complex HDXs. - Ryan O'Donnell; Noah G. Singer (CoRR, 2024)

Sparsifying Suprema of Gaussian Processes. - Anindya De; Shivam Nadimpalli; Ryan O'Donnell; Rocco A. Servedio (CoRR, 2024)

Quantum chi-squared tomography and mutual information testing. - Steven T. Flammia; Ryan O'Donnell (Quantum, 2024)

Improved quantum data analysis. - Costin Badescu; Ryan O'Donnell (TheoretiCS, 2024)

Pseudorandomness Properties of Random Reversible Circuits. - William Gay; William He; Nicholas Kocurek; Ryan O'Donnell (CRYPTO (1), 2025)

Quartic quantum speedups for planted inference. - Alexander Schmidhuber; Ryan O'Donnell; Robin Kothari; Ryan Babbush (SODA, 2025)

Learning the Closest Product State. - Ainesh Bakshi; John Bostanci; William Kretschmer; Zeph Landau; Jerry Li 001; Allen Liu; Ryan O'Donnell; Ewin Tang (STOC, 2025)

Explicit Two-Sided Vertex Expanders beyond the Spectral Barrier. - Jun-Ting Hsieh; Ting-Chun Lin; Sidhanth Mohanty; Ryan O'Donnell; Rachel Yun Zhang (STOC, 2025)

Uniformity Testing When You Have the Source Code. - Clément L. Canonne; Robin Kothari; Ryan O'Donnell (TQC, 2025)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State. - Meghal Gupta; William He; Ryan O'Donnell (CoRR, 2025)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy. - William Gay; William He; Nicholas Kocurek; Ryan O'Donnell (CoRR, 2025)

Instance-Optimal Quantum State Certification with Entangled Measurements. - Ryan O'Donnell; Chirag Wadhwa (CoRR, 2025)

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes. - Olakunle S. Abawonse; Jan Hazla; Ryan O'Donnell (CoRR, 2025)

A Classical Quadratic Speedup for Planted kXOR. - Meghal Gupta; William He; Ryan O'Donnell; Noah G. Singer (CoRR, 2025)