| Analysis of boolean functions R O'Donnell Cambridge University Press, 2014 | 1628 | 2014 |
| Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? S Khot, G Kindler, E Mossel, R O’Donnell SIAM Journal on Computing 37 (1), 319-357, 2007 | 913 | 2007 |
| Noise stability of functions with low influences: invariance and optimality E Mossel, R O'Donnell, K Oleszkiewicz FOCS 2005 171 (1), 295-341, 2005 | 624 | 2005 |
| Efficient quantum tomography R O'Donnell, J Wright Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 299 | 2016 |
| Learning functions of k relevant variables E Mossel, R O'Donnell, RA Servedio Journal of Computer and System Sciences 69 (3), 421-434, 2004 | 295* | 2004 |
| Learning intersections and thresholds of halfspaces AR Klivans, R O'Donnell, RA Servedio Journal of Computer and System Sciences 68 (4), 808-840, 2004 | 232 | 2004 |
| Every decision tree has an influential variable R O'Donnell, M Saks, O Schramm, RA Servedio 46th annual IEEE symposium on foundations of computer science (FOCS'05), 31-39, 2005 | 163 | 2005 |
| Some topics in analysis of Boolean functions R O'Donnell Proceedings of the fortieth annual ACM symposium on Theory of computing, 569-578, 2008 | 160 | 2008 |
| Learning monotone decision trees in polynomial time R O'Donnell, RA Servedio Computational Complexity, 2006. CCC 2006. Twenty-First Annual IEEE …, 2008 | 153 | 2008 |
| Optimal lower bounds for locality-sensitive hashing (except when q is tiny) R O’Donnell, Y Wu, Y Zhou ACM Transactions on Computation Theory (TOCT) 6 (1), 1-13, 2014 | 150 | 2014 |
| Hardness amplification within NP R O'Donnell Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 135 | 2002 |
| Learning geometric concepts via Gaussian surface area AR Klivans, R O'Donnell, RA Servedio 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 541-550, 2008 | 134 | 2008 |
| Learning mixtures of product distributions over discrete domains J Feldman, R O'Donnell, RA Servedio Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium …, 2005 | 132 | 2005 |
| Testing halfspaces K Matulef, R O'Donnell, R Rubinfeld, RA Servedio SIAM Journal on Computing 39 (5), 2004-2047, 2010 | 124 | 2010 |
| Sum of squares lower bounds for refuting any CSP PK Kothari, R Mori, R O'Donnell, D Witmer Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 123 | 2017 |
| Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes MB Hastings, J Haah, R O'Donnell Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 122 | 2021 |
| Testing Fourier dimensionality and sparsity P Gopalan, R O'Donnell, RA Servedio, A Shpilka, K Wimmer SIAM Journal on Computing 40 (4), 1075-1100, 2011 | 120 | 2011 |
| Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality E Mossel, R O'Donnell, O Regev, JE Steif, B Sudakov Israel Journal of Mathematics 154 (1), 299-336, 2006 | 119 | 2006 |
| PAC learning axis-aligned mixtures of Gaussians with no separation assumption J Feldman, RA Servedio, R O’Donnell Learning Theory: 19th Annual Conference on Learning Theory, COLT 2006 …, 2006 | 111 | 2006 |
| Quantum spectrum testing R O'Donnell, J Wright Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 105* | 2015 |
Rocco Anthony ServedioDepartment of Computer Science, Columbia University在 columbia.edu 的电子邮件经过验证