Theory and Algorithms
Theoretical computer science develops efficient algorithms and explores fundamental barriers to efficient and secure computation. Advances in algorithms can provide dramatic performance gains, which are critically important as the era of Moore's Law—and its promise of ever-increasing processor speeds—draws to a close.
Our faculty develop algorithms to find optimal paths, trees, flows, clusters, and other important combinatorial structures in geometric and network data. For problems where computing the best possible solution is prohibitively expensive, we develop fast approximation algorithms to compute provably good solutions, and we explore the limits of what cannot even be approximated quickly. We develop algorithms that exploit geometric, algebraic, and topological properties of data that arise naturally in practice. Within cryptography, we develop protocols for secure multiparty computation and code obfuscation. In algorithmic game theory, we study the impact of strategic behavior among multiple agents. Our research, in addition to its fundamental importance, has many near-term applications in Computer Science and beyond.
CS Faculty and Their Research Interests
|Timothy Chan||computational geometry|
|Chandra Chekuri||algorithms, optimization|
|Jeff Erickson||computational geometry and topology, algorithms|
|Michael Forbes||computational complexity|
|Brighten Godfrey||networked systems theory, distributed algorithms|
|Sariel Har-Peled||computational geometry, geometric approximation algorithms|
|Sheldon Jacobson||optimization, operations research|
|Dakshita Khurana||joining fall 2019; cryptography, privacy, security|
|Ruta Mehta||algorithmic game theory, mathematical economics, efficient algorithms|
|Leonard Pitt||AI and theoretical computing|
|Matus Telgarsky||machine learning theory|
|Mahesh Viswanathan||algorithmic verification of cyberphysical systems|
|Tandy Warnow||multiple sequence alignment, phylogenomics, metagenomics, and historical linguistics|
|Karthik Chandrasekaran, Industrial & Enterprise Systems Engineering||combinatorial optimization, integer programming, probabilistic methods and analysis, randomized algorithms|
|Negar Kiyavash, Electrical & Computer Engineering and Industrial & Enterprise Systems Engineering||learning, statistical signal processing, and information theory; causality; network forensics|
|Rakesh Nagi, Industrial & Enterprise Systems Engineering||social networks, graph algorithms, applied operations research, discrete optimization|
|Alexandra Kolla, University of Colorado at Boulder||complexity theory, spectral methods for graph algorithms|
|Manoj Prabhakaran, IIT Bombay||cryptography, secure multi-party computation|
Related Theory and Algorithms Research Efforts and Groups
- Information Trust Institute (ITI) in the Coordinated Science Lab
- Carl R. Woese Institute for Genomic Biology (IGB)
- Theory and Algorithms Group
To receive weekly reminders and announcements of Theory & Algorithms seminars, please sign up for the theory-seminar mailing list.
Theory and Algorithms Research News
The Columbus Dispatch -- Gregg Nigl almost didn’t fill out his March Madness bracket. But now, through 48 games of the NCAA men’s basketball tournament, his remains perfect, the last of its kind. The odds of Nigl correctly predicting the final 15 games, though, are about 1 in 32,786, said Sheldon H. Jacobson, a professor of computer science at the University of Illinois.
High Post Hoops -- University of Illinois computer science Professor Sheldon Jacobson has created a women’s tournament bracket simulator. So, want to know what’s likely to happen in the tournament? We ran 100 simulations to get a general sense. Here are the top questions that we can answer, thanks to the simulator.