World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
54
Citations
8625
World Ranking
4659
National Ranking
2161

Research.com Recognitions

  • 2009 - Fellow of Alfred P. Sloan Foundation

Overview

Ryan O'Donnell is a researcher affiliated with Carnegie Mellon University in the United States. Their work spans the fields of computer science and mathematics, with a significant focus on artificial intelligence and computational theory, as well as contributions to statistics, probability, and engineering subfields.

The scientist's research topics include quantum computing algorithms and architecture, quantum information and cryptography, machine learning and algorithms, complexity and algorithms in graphs, Markov chains and Monte Carlo methods, mathematical approximation and integration, as well as random matrices and applications.

Frequent co-authors of Ryan O'Donnell include Robin Kothari, Rocco A. Servedio, Costin Bădescu, Pedro Paredes, and R. Venkateswaran.

Major publication venues featuring O'Donnell's work comprise:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theory of Computing
  • Communications in Mathematical Physics
  • Journal of Health Organization and Management

Selected recent papers authored by Ryan O'Donnell include:

  • Locally Covert Learning, 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Quantum Spectrum Testing, 2021, Communications in Mathematical Physics

Ryan O'Donnell received the Fellow of Alfred P. Sloan Foundation award in 2009.

Best Publications

  • Analysis of Boolean Functions

    Ryan O'Donnell

  • Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?

    Subhash Khot;Guy Kindler;Elchanan Mossel;Ryan O’Donnell

  • Noise stability of functions with low influences: Invariance and optimality

    Elchanan Mossel;Ryan O’Donnell;Krzysztof Oleszkiewicz

  • Learning intersections and thresholds of halfspaces

    A. R. Klivans;R. O'Donnell;Rocco A. Servedio

  • Efficient quantum tomography II

    Ryan O'Donnell;John Wright

  • Noise stability of functions with low influences: Invariance and optimality

    E. Mossel;R. O'Donnell;K. Oleszkiewicz

  • Learning functions of k relevant variables

    Elchanan Mossel;Ryan O'Donnell;Rocco A. Servedio

  • Learning juntas

    Elchanan Mossel;Ryan O'Donnell;Rocco P. Servedio

  • Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

    S. Khot;G. Kindler;E. Mossel;R. O'Donnell

  • Some topics in analysis of boolean functions

    Ryan O'Donnell

  • Every decision tree has an influential variable

    R. O'Donnell;M. Saks;O. Schramm;R.A. Servedio

  • Hardness amplification within NP

    Ryan O'Donnell

  • Learning Monotone Decision Trees in Polynomial Time

    Ryan O'Donnell;Rocco A. Servedio

  • Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality

    Elchanan Mossel;Ryan O'Donnell;Oded Regev;Jeffrey E. Steif

  • Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)

    Ryan O’Donnell;Yi Wu;Yuan Zhou

  • Sum of squares lower bounds for refuting any CSP

    Pravesh K. Kothari;Ryuhei Mori;Ryan O'Donnell;David Witmer

  • Testing Halfspaces

    Kevin Matulef;Ryan O'Donnell;Ronitt Rubinfeld;Rocco A. Servedio

  • Learning Mixtures of Product Distributions over Discrete Domains

    Jon Feldman;Ryan O'Donnell;Rocco A. Servedio

  • Testing Fourier Dimensionality and Sparsity

    Parikshit Gopalan;Ryan O'Donnell;Rocco A. Servedio;Amir Shpilka

  • Learning Geometric Concepts via Gaussian Surface Area

    A.R. Klivans;R. O'Donnell;R.A. Servedio

  • Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes

    Matthew B. Hastings;Jeongwan Haah;Ryan O'Donnell

Frequent Co-Authors

Rocco A. Servedio
Rocco A. Servedio Columbia University
Subhash Khot
Subhash Khot Courant Institute of Mathematical Sciences
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Luca Trevisan
Luca Trevisan Bocconi University
Jon Feldman
Jon Feldman Google (United States)
Ilias Diakonikolas
Ilias Diakonikolas University of Wisconsin–Madison
Béla Bollobás
Béla Bollobás University of Memphis

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees opens doors to a variety of rewarding career pathways in computer science. For those seeking a quick entry into tech fields, an online associate's degree offers a flexible and affordable way to gain fundamental knowledge and skills. This path is ideal if you want to start working sooner or transfer credits toward a bachelor's degree later.

If advancing your qualifications is a goal, consider one of the shortest master degree programs. These accelerated options allow you to fast-track your education without lengthy time commitments. Choosing the right specialization is crucial—reviewing the what masters program should i do list can help you identify high-demand fields such as data science, cybersecurity, and artificial intelligence.

Finally, for immediate skills enhancement, look into certifications that pay well. These credentials offer practical expertise in specific technologies or software, boosting your resume and salary potential without a multi-year commitment.

Best Scientists Citing Ryan O'Donnell

Trending Scientists

Recently Published Articles