|
Search the dblp DataBase
Ryan O'Donnell:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ryan O'Donnell
Hardness Amplification within NP. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:23- [Conf]
- Ryan O'Donnell, Rocco A. Servedio
Extremal properties of polynomial threshold functions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:3-12 [Conf]
- Ryan O'Donnell, Rocco A. Servedio
Learning Monotone Decision Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:213-225 [Conf]
- Jon Feldman, Rocco A. Servedio, Ryan O'Donnell
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. [Citation Graph (0, 0)][DBLP] COLT, 2006, pp:20-34 [Conf]
- Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
Learning DNF from Random Walks. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:189-0 [Conf]
- Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:146-154 [Conf]
- Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
Learning Intersections and Thresholds of Halfspaces. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:177-186 [Conf]
- Ryan O'Donnell, Michael E. Saks, Oded Schramm, Rocco A. Servedio
Every decision tree has an in.uential variable. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:31-39 [Conf]
- Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
Noise stability of functions with low in.uences invariance and optimality. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:21-30 [Conf]
- Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
Learning mixtures of product distributions over discrete domains. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:501-510 [Conf]
- Subhash Khot, Ryan O'Donnell
SDP gaps and UGC-hardness for MAXCUTGAIN. [Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:217-226 [Conf]
- Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell
Eliminating Cycles in the Discrete Torus. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:202-210 [Conf]
- Lars Engebretsen, Piotr Indyk, Ryan O'Donnell
Derandomized dimensionality reduction with applications. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:705-712 [Conf]
- Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
On the fourier tails of bounded functions over the discrete cube. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:437-446 [Conf]
- Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
Learning juntas. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:206-212 [Conf]
- Ryan O'Donnell
Hardness amplification within NP. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:751-760 [Conf]
- Ryan O'Donnell, Rocco A. Servedio
New degree bounds for polynomial threshold functions. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:325-334 [Conf]
- Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:101, pp:- [Journal]
- Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
Learning DNF from random walks. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:3, pp:250-265 [Journal]
- Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
Learning intersections and thresholds of halfspaces. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:4, pp:808-840 [Journal]
- Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
Learning functions of k relevant variables. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:421-434 [Journal]
- Ryan O'Donnell
Hardness amplification within NP. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:1, pp:68-94 [Journal]
- Elchanan Mossel, Ryan O'Donnell
On the noise sensitivity of monotone functions. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2003, v:23, n:3, pp:333-350 [Journal]
- Elchanan Mossel, Ryan O'Donnell
Coin flipping from a cosmic source: On error correction of truly random bits. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:26, n:4, pp:418-436 [Journal]
- Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:1, pp:319-357 [Journal]
- Uriel Feige, Guy Kindler, Ryan O'Donnell
Understanding Parallel Repetition Requires Understanding Foams. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:179-192 [Conf]
- Ryan O'Donnell, Karl Wimmer
Approximation by DNF: Examples and Counterexamples. [Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:195-206 [Conf]
- Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
Noise stability of functions with low influences: invariance and optimality [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal]
- Ryan O'Donnell, Rocco A. Servedio
Learning Monotone Decision Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:827-844 [Journal]
Testing ±1-weight halfspace. [Citation Graph (, )][DBLP]
Lower Bounds for Testing Function Isomorphism. [Citation Graph (, )][DBLP]
Fooling Functions of Halfspaces under Product Distributions. [Citation Graph (, )][DBLP]
Polynomial Regression under Arbitrary Product Distributions. [Citation Graph (, )][DBLP]
Spherical Cubes and Rounding in High Dimensions. [Citation Graph (, )][DBLP]
Learning Geometric Concepts via Gaussian Surface Area. [Citation Graph (, )][DBLP]
KKL, Kruskal-Katona, and Monotone Nets. [Citation Graph (, )][DBLP]
Testing Fourier Dimensionality and Sparsity. [Citation Graph (, )][DBLP]
SDP Gaps for 2-to-1 and Other Label-Cover Variants. [Citation Graph (, )][DBLP]
3-bit dictator testing: 1 vs. 5/8. [Citation Graph (, )][DBLP]
Testing halfspaces. [Citation Graph (, )][DBLP]
Some topics in analysis of boolean functions. [Citation Graph (, )][DBLP]
An optimal sdp algorithm for max-cut, and equally optimal long code tests. [Citation Graph (, )][DBLP]
The chow parameters problem. [Citation Graph (, )][DBLP]
Conditional hardness for satisfiable 3-CSPs. [Citation Graph (, )][DBLP]
Eliminating Cycles in the Discrete Torus. [Citation Graph (, )][DBLP]
Every decision tree has an influential variable [Citation Graph (, )][DBLP]
Optimal lower bounds for locality sensitive hashing (except when q is tiny) [Citation Graph (, )][DBLP]
Fooling functions of halfspaces under product distributions [Citation Graph (, )][DBLP]
Some Topics in Analysis of Boolean Functions. [Citation Graph (, )][DBLP]
Understanding Parallel Repetition Requires Understanding Foams. [Citation Graph (, )][DBLP]
Testing Halfspaces. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.304secs
|