The following pages link to Ryan O'Donnell (Q598256):
Displaying 50 items.
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs (Q737177) (← links)
- Sharpness of KKL on Schreier graphs (Q742981) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- Lower bounds for testing complete positivity and quantum separability (Q2081633) (← links)
- Log-Sobolev inequality for the multislice, with applications (Q2119683) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- On the Fourier tails of bounded functions over the discrete cube (Q2480580) (← links)
- Eliminating cycles in the discrete torus (Q2482730) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Linear programming, width-1 CSPs, and robust satisfaction (Q2826079) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups (Q2828232) (← links)
- On the fourier tails of bounded functions over the discrete cube (Q2931406) (← links)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Optimal Bounds for Estimating Entropy with PMF Queries (Q2946389) (← links)
- One Time-traveling Bit is as Good as Logarithmically Many (Q2978537) (← links)
- The Chow Parameters Problem (Q2999860) (← links)
- (Q3002802) (← links)
- Testing Halfspaces (Q3053158) (← links)
- Algorithmic Signaling of Features in Auction Design (Q3449589) (← links)
- Learning Monotone Decision Trees in Polynomial Time (Q3507522) (← links)
- Eliminating Cycles in the Discrete Torus (Q3525760) (← links)
- Learning Mixtures of Product Distributions over Discrete Domains (Q3532576) (← links)
- (Q3549717) (← links)
- Learning juntas (Q3581270) (← links)
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (Q3587413) (← links)
- Testing ±1-weight halfspace (Q3638910) (← links)
- (Q4428928) (← links)
- On the noise sensitivity of monotone functions (Q4431436) (← links)
- Social choice, computational complexity, Gaussian geometry, and Boolean functions (Q4589022) (← links)
- (Q4633833) (← links)
- (Q4633845) (← links)
- SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
- (Q4829005) (← links)
- Pareto Optimal Solutions for Smoothed Analysts (Q4907582) (← links)
- Testing (Subclasses of) Halfspaces (Q4933385) (← links)
- The Weakness of CTC Qubits and the Power of Approximate Counting (Q4973873) (← links)
- Sum of squares lower bounds for refuting any CSP (Q4977967) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q4978045) (← links)
- (Q5009552) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5090410) (← links)
- (Q5090427) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
