Explore a research direction

Theoretical computer science
research labs.

Explore labs that list theoretical computer science among their research interests, including work on algorithms, complexity, cryptography and the limits of computation. Each profile links to its official sources so you can check what a group actually studies before you decide whom to contact.

What to compare

When comparing groups in theoretical computer science, look at the proof techniques and problem areas a group favors, and whether its results connect to applications. Ask how a new researcher would be involved and what preparation is expected.

Profiles appear here because their listed research keywords match this topic. Inclusion does not establish an open position. Check the official sources and any published application instructions before reaching out.

Prepare a research introduction ↗

16 research-led lab profiles

Browse labs by their listed college affiliation
ASIndependently curated · Unclaimed
H. Milton Stewart School of Industrial and Systems Engineering↗

Arkadi S. Nemirovski Research Group

Georgia Institute of Technology

Arkadi S. Nemirovski · John P. Hunter, Jr. Chair and Professor

How can efficient algorithms for nonlinear convex programs be developed and their complexity investigated? Arkadi Nemirovski is the John P. Hunter, Jr. Chair in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. His research interests focus on optimization theory and algorithms, with emphasis on investigating complexity. His interests also include optimization under uncertainty and applications of convex optimization in engineering. His research interests additionally include nonparametric statistics.

convex optimizationoptimization theoryalgorithms
CKIndependently curated · Unclaimed
Ray and Stephanie Lane Computational Biology Department↗

Carl Kingsford Research Group

Carnegie Mellon University

Carl Kingsford · Professor of Computer Science

How can efficient algorithms extract knowledge from large biological data sets? Carl Kingsford is a Professor of Computer Science in the Ray and Stephanie Lane Computational Biology Department. His research is focused on developing new, efficient algorithms for extracting knowledge from large biological data sets, particularly high-throughput DNA and RNA sequencing data. He has worked recently on algorithms for accurately quantifying gene expression and identifying compact regions of chromatin, among other topics. His group typically explores solutions using optimization, graph algorithms, and machine learning.

computational biologyalgorithmssequencing data
CDIndependently curated · Unclaimed
Computer Science↗

Cynthia Dwork Research Group

Harvard University

Cynthia Dwork · Gordon McKay Professor of Computer Science

How can theoretical computer science place societal problems on a firm mathematical foundation? Cynthia Dwork uses theoretical computer science to place societal problems on a firm mathematical foundation. She is Gordon McKay Professor of Computer Science at Harvard University. She is also affiliated faculty at Harvard Law School. Her research areas listed in the SEAS directory include theory of computation, computation and society, artificial intelligence, machine learning, and privacy and security.

theoretical computer scienceprivacy and securitymachine learning
DBIndependently curated · Unclaimed
Computer Science↗

Dan Boneh Research Group

Stanford University

Dan Boneh · Professor of Computer Science and Electrical Engineering

Can cryptographic proofs scale to verify large model computations without revealing model parameters? The group develops succinct zero-knowledge and folding-based SNARK constructions to reduce proof size and verification cost for large computations. Researchers design homomorphic and lattice-based encryption schemes and residue-number-system techniques to enable arithmetic on encrypted large integers. They prototype verifiable computation and authenticated-data systems for scalable image and web security, combining IOPs and accumulators to enable integrity checks at scale. The lab evaluates web, mobile, and blockchain security, producing protocols for privacy-preserving airdrops and accountable threshold signatures.

cryptographycomputer securityapplied cryptography
DKIndependently curated · Unclaimed
EECS↗

David Karger Research Group

Massachusetts Institute of Technology

David Karger · Professor

How can tools help individuals manage information better? David Karger is a member of the Computer Science and Artificial Intelligence Laboratory in the EECS department at MIT. The work involves studying people and current tools to understand where the problems are, then creating, evaluating and deploying tools that address them. He draws on information retrieval, machine learning, databases, and algorithms, but most often human computer interaction. He began his career in algorithms and remains interested in applying algorithms to real world problems.

information managementhuman computer interactionalgorithms
EUIndependently curated · Unclaimed
Computer Science↗

Eli Upfal Research Group

Brown University

Eli Upfal · Rush C. Hawkins Professor of Computer Science

How can probability theory and combinatorics be applied to the design and analysis of computer algorithms? Eli Upfal's general research area is theory of computation, applying rigorous mathematical tools to the design and analysis of computer algorithms. Randomness comes up in the study of randomized algorithms and probabilistic analysis of algorithms. Probabilistic analysis of algorithms attempts to characterize the average-case performance of algorithms on typical inputs. Recent work includes probabilistic techniques for studying the long-term behavior of dynamic computer processes such as communication, load balancing, cashing, and paging.

algorithmsrandomized algorithmsprobabilistic analysis
ILIndependently curated · Unclaimed
↗

Isaac L. Chuang Research Group

Massachusetts Institute of Technology

Isaac L. Chuang · Professor of Physics

How can large-scale quantum computers and cryptographic systems be built? Isaac Chuang is a principal investigator in the Research Laboratory of Electronics at MIT. He is widely recognized for pioneering work in the creation of quantum computers while at IBM’s Almaden Research Center. He is a co-author, with Michael A. Nielsen, of Quantum Computation and Quantum Information. His listed keywords include quantum information theory, entanglement and cryptography, and spin detection and manipulation.

quantum computationquantum information theorycryptography
KNIndependently curated · Unclaimed
Computer Science↗

Kobbi Nissim Research Group

Georgetown University

Kobbi Nissim · Professor

How can rigorous practices for privacy in computation be established? Kobbi Nissim's research formalizes and studies the problems that arise from the collection, sharing, and processing of information. He is particularly interested in the intersections between privacy and fields including cryptography, machine learning, game theory, and complexity theory. A current project takes an end-to-end approach to formal privacy for sample surveys and is funded by the Census Bureau. Another project pursues the co-design of law and computer science for privacy in sociotechnical software systems.

differential privacycryptographyprivacy law and policy
MYIndependently curated · Unclaimed
↗

Mark Yu. Borodovsky Research Group

Georgia Institute of Technology

Mark Yu. Borodovsky · Regents' Professor, Joint with Wallace H. Coulter Department

How can machine learning algorithms analyze biological sequences such as DNA, RNA and proteins? Mark Borodovsky is a Regents' Professor jointly with the Wallace H. Coulter Department of Biomedical Engineering. His group develops machine learning algorithms for computational analysis of biological sequences. The primary focus is prediction of protein-coding genes and regulatory sites in genomic DNA. Probabilistic models play an important role in the algorithm framework, given the probabilistic nature of biological sequence evolution.

machine learningbioinformaticsalgorithms
MTIndependently curated · Unclaimed
Department of Computer Science↗

Michael T. Goodrich Research Group

University of California, Irvine

Michael T. Goodrich · Distinguished Professor

What efficient algorithms and data structures enable secure, privacy-preserving computation on large distributed systems? His research develops algorithm designs and data structures for diverse computational models including RAM, parallel, distributed, and external-memory. The group works on privacy-preserving data access and efficient solutions for problems like nearest-neighbor searching, convex hulls, and sorting using theoretical and practical algorithmic techniques. Researchers build secure distributed data structures and protocols to support information assurance and cloud security. The group applies these algorithmic methods to networking, machine learning, and geometric computing problems.

algorithmsdata structuressecurity
PFIndependently curated · Unclaimed
Professor of Engineering and Computer Science↗

Pedro F. Felzenszwalb Research Group

Brown University

Pedro F. Felzenszwalb · Professor of Engineering and Computer Science

How can algorithms detect and localize people and objects robustly in natural images with deformations and occlusions? The lab developed and evaluated a deformable part model for person detection in benchmark challenges to improve object localization under variation. Researchers design and analyze algorithms connecting computer vision with optimization and statistics to enable reliable image restoration and segmentation. The group implements method combinations from machine learning, signal processing and natural language processing to address mid- and high-level vision tasks. The team releases papers, talk slides and code to document methods and reproducible evaluations.

computer visionmachine learningartificial intelligence
RCIndependently curated · Unclaimed
Computer Science↗

Ran Canetti Research Group

Boston University

Ran Canetti · Wang Professor of Computer Science

How can cryptographic protocols be designed, analyzed and used to secure information? Ran Canetti is a professor of Computer Science at Boston University and the director of the center for Reliable Information System and Cyber Security. His research interests span multiple aspects of cryptography and information security. He is a Fellow of the International Association for Cryptologic Research and an associate editor of the Journal of Cryptology and Information and Computation. He is the Wang Professor of Computer Science and was previously a researcher at IBM Watson Research Center.

cryptographyinformation securitycryptographic protocols
RLIndependently curated · Unclaimed
Electrical Engineering and Computer Science↗

Ronald L. Rivest Research Group

Massachusetts Institute of Technology

Ronald L. Rivest · Institute Professor

How can cryptography and security methods protect systems such as elections and exposure notification? Ronald L. Rivest has worked extensively in cryptography and is a co-inventor of the RSA public-key cryptosystem. His research interests include computer and network security, algorithms, and voting security. He is a member of the Theory of Computation Group and a founder of the Cryptography and Information Security Group in CSAIL. More recently his work has addressed contact tracing through exposure notification.

cryptographycomputer securityvoting security
SSIndependently curated · Unclaimed
School of Computer Science↗

Santosh S. Vempala Research Group

Georgia Institute of Technology

Santosh S. Vempala · Distinguished Professor

What can randomized algorithms and computational geometry reveal about learning? Santosh Vempala is a Distinguished Professor of Computer Science at the Georgia Institute of Technology. His main work has been in the area of theoretical computer science. He has authored books on random projection and spectral methods, alongside his research in theoretical computer science. He co-founded the Computing for Good (C4G) program at Georgia Tech, where he is a Distinguished Professor of Computer Science.

theoretical computer sciencealgorithmsrandomized algorithms
TWIndependently curated · Unclaimed
Siebel School of Computing and Data Science↗

Tandy Warnow Research Group

University of Illinois at Urbana-Champaign

Tandy Warnow · Founder Professor of Engineering

How can algorithms estimate evolutionary trees, a task called phylogeny estimation, from biological data? Tandy Warnow joined the University of Illinois at Urbana-Champaign as a Founder Professor of Engineering. Her research is in algorithms for network science, computational biology, and historical linguistics. Her contributions include methods for multiple sequence alignment and for species tree estimation from multi-gene datasets. She is Associate Director for the Siebel School of Computing and Data Science.

phylogeneticscomputational biologyalgorithms
TRIndependently curated · Unclaimed
↗

Tim Roughgarden Research Group

Columbia University

Tim Roughgarden · Professor of Computer Science

How can mechanism design create incentives for truthful behavior in decentralized blockchain systems? The research explores theoretical foundations connecting algorithms and mechanism design to model strategic behavior in networks and markets. The group develops algorithms and rigorous analysis from algorithmic game theory to characterize equilibrium outcomes and computational complexity. Work on blockchains studies incentive-compatible protocol design and consensus mechanisms to align participant behavior in decentralized systems. Researchers apply game-theoretic proofs and complexity bounds to evaluate robustness, optimality, and trade-offs of mechanisms and algorithms.

theoryalgorithmsalgorithmic game theory

Showing 1–16 of 16 labs

Explore the listed universities