FIND PROFESSORS AND RESEARCH OPPORTUNITIES

YourScholar.ai helps discover professors by research area, explore academic profiles, and find potential collaboration opportunities for Master's, PhD, and scholarship applications.

4138_odonnell-ryan-2023.jpg

Ryan O'Donnell

Analysis Of Boolean Functions Unique Games Conjecture Property Testing Algorithmic Game Theory Quantum Learning

Research Performance Summary

172
Total Papers
10367
Total Citations
52
H-Index
2002-2026
Active Research Span

First Recorded Paper

Hardness amplification within NP

Year: 2002

Citations: 138

Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Latest Recorded Paper

A Classical Quadratic Speedup for Plantedxor

Year: 2026

Citations: 2

Venue: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms

Last 10 Years Publication Activity

This timeline shows the professor's yearly publication activity.

2026
1
2025
13
2024
7
2023
3
2022
7
2021
10
2020
5
2019
8
2018
8
2017
15
2016
6

Publication Venues and Collaboration

Journal, Conference, and Book Publication Breakdown

Conference 70
Journal 20
Book 3

Top Coauthors

O'Donnell O’Donnell Servedio

Research Impact by Period

2025-2026

Period Stats
Papers 14
Citations 71
Avg. Citations / Paper 5.1
H-Index 5

2020-2024

Period Stats
Papers 32
Citations 867
Avg. Citations / Paper 27.1
H-Index 15

2015-2019

Period Stats
Papers 47
Citations 1671
Avg. Citations / Paper 35.6
H-Index 16

2010-2014

Period Stats
Papers 39
Citations 3317
Avg. Citations / Paper 85.1
H-Index 23

2005-2009

Period Stats
Papers 30
Citations 3445
Avg. Citations / Paper 114.8
H-Index 22

2000-2004

Period Stats
Papers 10
Citations 996
Avg. Citations / Paper 99.6
H-Index 7

Contact and Professional Links

Contact Information

odonnell@cs.cmu.edu
4122684802

Professional Links

Google Scholar
University Page

Detected Research Keywords

Analysis Boolean Functions Quantum Ldpc Codes Polynomial Threshold Functions Computational Complexity Conference Conference Computational Complexity Optimal Inapproximability Results Inapproximability Results Max Results Max Cut Max Cut Other Cut Other Variable