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 APPROXIMATION ALGORITHMS

Showing page 1 of 1 — 11 professors available publicly

Shafi Goldwasser

Shafi Goldwasser

Fault Tolerant Distributed Computing Probabilistic Proof Systems Computational Number Theory

Director of the Simons Institute for the Theory of Computing. Principal fields of interest: Cryptography, Computational Number Theory, Complexity Theory, Fault Tolerant Distributed Computing, Probabilistic Proof Systems, Approximation Algorithms.

John Wright

John Wright

quantum state learning quantum complexity theory property testing

My research is in theoretical computer science, with an emphasis on quantum computing. More specifically, I work on quantum state learning, quantum complexity theory, property testing, and approximation algorithms. Before joining UC Berkeley, I was at UT Austin, MIT and Caltec...

Kirk R. Pruhs

Kirk R. Pruhs

Scheduling Algorithms Algorithmic Game Theory Online Algorithms

Professor Pruhs received a BS degree (Mathematics and Computer Science, 1984) from Iowa State University and a PhD degree (Computer Science, 1989) from the University of Wisconsin-Madison. He is on the editorial boards of Journal of Scheduling, INFORMS Journal of Computing, and A...

Daniel Grosu

Daniel Grosu

Cloud and Edge Computing Parallel and Distributed Algorithms Approximation Algorithms

Daniel Grosu's research focuses on cloud and edge computing, parallel and distributed algorithms, graph algorithms, approximation algorithms, scheduling and load balancing, and topics at the border between computer science, game theory and economics. He is an IEEE Computer Societ...

Thang Dinh

Thang Dinh

graph machine learning quantum computing approximation algorithms

Thang N. Dinh is an Associate Professor in the Department of Computer Science at Virginia Commonwealth University, where he has been a faculty member since 2019, after serving as an Assistant Professor from 2013 to 2019. He earned his Ph.D. in Computer Engineering from the Univer...

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...

Lap Chi Lau

Lap Chi Lau

Algorithmic Graph Theory Approximation Algorithms Combinatorial Optimization

Lap Chi Lau is a Professor in the David R. Cheriton School of Computer Science at the University of Waterloo. His research focuses on theoretical computer science, particularly algorithm design and analysis, including algorithmic graph theory, approximation algorithms, combinator...

Erik Saule

Erik Saule

Multi Objective Optimization Approximation Algorithms Parallel Computing

Erik Saule is an Associate Professor in the Computer Science department of UNC Charlotte and has been a faculty of UNC Charlotte since August 2013. He received his License and Maitrise in Computer Science in 2003 from University of Versailles, France and his Master and PhD in Com...

Abolfazl Asudeh

Abolfazl Asudeh

Approximation Algorithms Randomized Algorithms Computational Geometry Algorithms

A. Asudeh is an Associate Professor of Computer Science at the University of Illinois Chicago and the director of Innovative Data Exploration Laboratory (InDeX Lab). His research focus is on Algorithm Design for Data and AI problems. He designs efficient, accurate, and responsib...

 Piotr Krysta

Piotr Krysta

Approximation Algorithms Combinatorial Optimization Randomized Algorithms

I am a Professor in the Department of Computer Science and a member of research groups on Algorithms, Complexity Theory and Optimisation and Economics and Computation. I am interested in the design and analysis of algorithms with an emphasis on: Approximation algori...

Kent Quanrud

Kent Quanrud

approximation algorithms randomized algorithms combinatorial optimization

My research is about the design and analysis of algorithms in theoretical computer science. I have worked on approximation algorithms, randomized algorithms, combinatorial optimization, continuous optimization, online learning, and discrete geometry. I am particularly interested ...