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.

PROFESSORS IN COMPUTATIONAL COMPLEXITY THEORY

Showing page 1 of 1 — 13 professors available publicly

Scott Aaronson

Scott Aaronson

Quantum Computational Complexity Quantum Algorithms Limits of Quantum Computation

Prior to coming to UT, Aaronson taught for nine years in Electrical Engineering and Computer Science at MIT. His primary area of research is theoretical computer science, and his research interests center around the capabilities and limits of quantum computers, and computational ...

Ryan Williams

Ryan Williams

Algorithm Design Computational Complexity Theory Algorithmic Lower Bounds

In general, I try to understand what is easy and what is hard to compute, independently of any particular computer. I work in algorithm design and complexity theory, and I especially like connections between the two subjects. I think about many questions, but a few of them haunt ...

Raghu Meka

Raghu Meka

Computational Complexity Theory Algorithmic Learning Theory Probabilistic Analysis of Algorithms

I am a Professor in the CS department at UCLA. I am broadly interested in complexity theory, learning and probability theory. See my publications and talks for more details. I am part of UCLA's theory group. I am pleased to have received IEEE's W. Wallace McDowell Award for 2025.

Mark Bun

Mark Bun

Differentially Private Data Analysis Polynomial Analysis of Boolean Functions Computational Complexity Theory

Mark Bun focuses on theoretical computer science, including data privacy, computational complexity, cryptography, and the foundations of machine learning. He uses polynomials (continuous functions) to investigate fundamental properties of Boolean (discrete) functions and has also...

Aviad Rubinstein

Aviad Rubinstein

Game-Theoretic Computation Computational Complexity Theory Algorithmic Mechanism Design

Aviad Rubinstein is an Assistant/Associate Professor of Computer Science at Stanford University. He is a theoretical computer scientist whose research focuses on algorithms, computational complexity, and game-theoretic computation, exploring the limits of efficient computation an...

Amit Chakrabarti

Amit Chakrabarti

Theoretical Computer Science Computational Complexity Theory Algorithmic Information Theory

I am interested broadly in theoretical computer science: the study and discovery of fundamental computational principles that are mathematical truths, unaffected by changes in computing technology and hardware.

Sam Hopkins

Sam Hopkins

Theory of Computing Computational Complexity Theory Algorithmic Game Theory

I am a theoretical computer scientist and Assistant Professor at MIT, in the Theory of Computing group in the Department of Electrical Engineering and Computer Science, where I hold the Jamieson Career Development Chair. Previously, I was a Miller fellow in the theory of compu...

Alexander Sherstov

Alexander Sherstov

Computational Complexity Theory Computational Learning Theory Quantum Computing

I am a professor at UCLA, in the Department of Computer Science. My area of specialization is theoretical computer science. I am particularly interested in computational complexity theory, computational learning theory, and quantum computing. Prior to joining UCLA, I was a postdo...

Euiwoong Lee

Euiwoong Lee

Theoretical Computer Science (TCS) Computational Complexity Theory Cryptography

I am an assistant professor in the Computer Science and Engineering Division at the University of Michigan. Previously, I was a postdoc at New York University hosted by Oded Regev and Subhash Khot, and a research fellow at Simons Institute for the Theory of Computing. I received ...

Vinodchandran Variyam

Vinodchandran Variyam

Computational Complexity Theory Resource-Bounded Computation Algorithm Design

Professor Vinodchandran Variyam is a prominent faculty member at the University of Nebraska–Lincoln, where he serves as a Professor and the Software Development Tribe Lead within the School of Computing. His work is primarily centered on the foundational aspects of computer sci...

Pavan Aduri

Pavan Aduri

Computational Complexity Theory Algorithmic Replicability Data Stream Models

Pavan Aduri is a Professor and the current Interim Chair of the Department of Computer Science at Iowa State University, a role he began in July 2024. He also serves as the Chair of the Graduate Admissions & Recruitment Committee. Dr. Aduri earned his Ph.D. from the University at...

William Kretschmer

William Kretschmer

Theory of Quantum Information Quantum Computation Quantum Cryptography

William Kretschmer is an Assistant Professor of Computer Science. His research lies broadly in the theory of quantum information and computation, with connections to complexity theory, cryptography, and learning. He earned his Ph.D. from UT Austin and his B.S. from MIT. Before re...

Shravas Rao

Shravas Rao

Lattice-Based Cryptography Quantum-Resistant Cryptography Algorithmic Number Theory

I am an assistant professor in the computer science department at Portland State University. My interests include theoretical computer science. Before this, I was a Warren Postdoctoral Fellow at Northwestern, and a graduate student in the computer science department at New York...