Ryan O'Donnell

Ryan O'Donnell

Professor

ORCID 0000-0001-7608-1458

Office

7213 Gates and Hillman Centers

Email

Phone

(412) 268-4802

Department

Computer Science Department

Administrative Support

Emi Perdan

Research Areas

Research Interests

     Algorithms and Complexity

     Security and Privacy

Advisees

William He

Jingxun Liang

Noah Singer

CSD Courses Taught

15459 - Spring, 2026

15251 - Fall, 2025

Research Statement


My research interests are:

  • Fourier Analysis of Boolean functions

  • Constraint satisfaction problems: random instances and inapproximability

  • Quantum computation and information theory

  • Complexity theory, especially concrete complexity and proof complexity

  • Probability theory

  • Property testing and learning theory


Publications

Conference

Learning the Closest Product State

2025 • Annual ACM Symposium on Theory of Computing • 1212-1221
Bakshi A, Bostanci J, Kretschmer W, Landau Z, Li J, Liu A, O'Donnell R, Tang E

Journal Article

Welcome from the Program Chair

2024 • Annual ACM Symposium on Theory of Computing • iii-iv
Mohar B, Shinkar I, O'Donnell R