Algorithms and Theory
Algorithms and Theory
Theoretical Computer Science (TCS) is concerned with understanding the very nature of computation: What problems can be solved by computers and how efficiently can such problems be solved? Can "hard" problems be used to our advantage in any way? TCS encompasses research in such diverse areas as complexity theory, algorithms, cryptography and coding theory, distributed and parallel computing, social networks, machine learning, game theory, and more. The common thread is a focus on precise models and rigorous mathematical analysis of particular problems within those models.
Associated Faculty
Andrew Childs
Professor
Laxman Dhulipala
Assistant Professor
William Gasarch
Professor
Daniel Gottesman
ProfessorBrin Family Endowed Professor in Theoretical Computer Science
Mohammad Hajiaghayi
ProfessorJack and Rita G. Minker Professor
Furong Huang
Associate Professor
Jonathan Katz
ProfessorDistinguished Scholar-Teacher
Clyde Kruskal
Associate Professor
David Mount
Professor
Rob Patro
Associate Professor
Hanan Samet
ProfessorDistinguished University Professor
Han Shao
Assistant Professor(Joining in Fall 2025)
Aravind Srinivasan
ProfessorDistinguished University Professor
Runzhou Tao
Assistant Professor
Xiaodi Wu
Associate Professor
Samir Khuller
Professor EmeritusDistinguished Scholar Teacher
Matthew Coudron
Adjunct Assistant Professor
Yi-Kai Liu
Adjunct Associate Professor
Carl Miller
Adjunct Associate Professor
S. Cenk Sahinalp
Adjunct ProfessorSenior Investigator, National Cancer Institute, NIH
Alexander Barg
Affiliate Professor
Dana Dachman-Soled
Affiliate Associate Professor
Sanghamitra Dutta
Affiliate Assistant Professor
Uzi Vishkin
Affiliate Professor
Haizhao Yang
Affiliate Associate Professor