Conference Every decision tree has an influential variable 2005 • Annual Symposium on Foundations of Computer Science • 2005:31-39 O'Donnell R, Saks M, Schramm O, Servedio RA
Conference Learning DNF from random walks 2005 • Journal of Computer and System Sciences • 71(3):250-265 Bshouty NH, Mossel E, O'Donnell R, Servedio RA
Conference Learning mixtures of product distributions over discrete domains 2005 • Annual Symposium on Foundations of Computer Science • 2005:501-510 Feldman J, O'Donnell R, Servedio RA
Conference Noise stability of functions with low influences: Invariance and optimality 2005 • Annual Symposium on Foundations of Computer Science • 2005:21-30 Mossel E, O'Donnell R, Oleszkiewicz K
Conference Proceedings of the Annual IEEE Conference on Computational Complexity: Preface 2005 • Proceedings of the Annual IEEE Conference on Computational Complexity Aaronson S, Bonet M, Dinur I, Gál A, Van Melkebeek D, Miltersen PB, O'Donnell R, Regev O, Rubinfeld R, Trevisan L
Conference Hardness amplification within NP 2004 • Journal of Computer and System Sciences • 69(1):68-94 O'Donnell R
Conference Learning functions of k relevant variables 2004 • Journal of Computer and System Sciences • 69(3 SPEC. ISS.):421-434 Mossel E, O'Donnell R, Servedio RA
Conference Learning intersections and thresholds of halfspaces 2004 • Journal of Computer and System Sciences • 68(4):808-840 Klivans AR, O'Donnell R, Servedio RA
Conference Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? 2004 • Annual Symposium on Foundations of Computer Science • 146-154 Khot S, Kindler G, O'Donnell R, Mossel E
Conference Extremal properties of polynomial threshold functions 2003 • Proceedings of the Annual IEEE Conference on Computational Complexity • 3-12 O'Donnell R, Servedio RA
Conference Learning DNF from random walks 2003 • Annual Symposium on Foundations of Computer Science • 189-198 Bshouty N, Mossel E, O'Donnell R, Servedio RA
Conference Learning DNF from random walks 2003 • Annual Symposium on Foundations of Computer Science • 2003-January:189-198 Bshouty N, Mossel E, O'Donnell R, Servedio RA
Conference Learning juntas 2003 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 206-212 Mossel E, O'Donnell R, Seryedio RA
Conference New degree bounds for polynomial threshold functions 2003 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 325-334 O'Donnell R, Servedio RA
Journal Article On the Noise Sensitivity of Monotone Functions 2003 • Random structures & algorithms (Print) • 23(3):333-350 Mossel E, O'Donnell R
Conference Derandomized dimensionality reduction with applications 2002 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 06-08-January-2002:705-712 Engebretsen L, Indyk P, O'Donnell R
Conference Hardness amplification within NP 2002 • Proceedings of the Annual IEEE Conference on Computational Complexity • 23 O'Donnell R
Conference Hardness amplification within NP 2002 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 751-760 O'Donnell R
Conference Learning intersections and thresholds of halfspaces 2002 • Annual Symposium on Foundations of Computer Science • 177-186 Klivans AR, O'Donnell R, Servedio RA
