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 (joining January 2017)||computational geometry|
|Chandra Chekuri||algorithms, optimization|
|Jeff Erickson||computational geometry and topology, algorithms|
|Michael Forbes (joining June 2017)||computational complexity|
|Brighten Godfrey||networked systems theory, distributed algorithms|
|Sariel Har-Peled||computational geometry, geometric approximation algorithms|
|Sheldon Jacobson||optimization, operations research|
|Alexandra Kolla||complexity theory, spectral methods for graph algorithms|
|Ruta Mehta||algorithmic game theory, mathematical economics, efficient algorithms|
|Leonard Pitt||AI and theoretical computing|
|Manoj Prabhakaran||cryptography, secure multi-party computation|
|Matus Telgarsky||machine learning theory|
|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|
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
Chicago Tribune - A study from CS Professor Sheldon Jacobson shows that making PreCheck free for all travelers could save the TSA millions of dollars.
The News-Gazette - CS Prof. Sheldon Jacobson talked about the aftermath of the presidential election. A near-total swing in undecided voters to Trump was 1 of 21 scenarios laid out at the Election Analytics website, but most analysts discounted it.