Theory & Algorithms
Theory & Algorithms
Lab Locations
- 3303 Siebel Center
Faculty
| Jeff Erickson | computational geometry and topology |
| Lenny Pitt | AI and theoretical computing |
| Chandra Chekuri | algorithms, optimization |
| Brighten Godfrey | networked systems theory, distributed algorithms |
| Sariel Har-Peled | geometric approximation algorithms |
| Manoj Prabhakaran | cryptography |
| Mahesh Viswanathan | algorithm analysis and validation |
| Steven M. LaValle | motion planning, control theory |
| Michael C. Loui | computational complexity theory |
| Jiming Peng | mathematical programming, optimization, approximation algorithms |
| Dan Roth | machine learning |
| Sheldon Jacobson | optimization, operations research |
| Todd Prentice Coleman | network information theory |
| Martin Wong | algorithm analysis and design |
Research in theoretical computer science focuses on the design and analysis of algorithms and data structures, as well as the study of fundamental barriers to efficient computation. Specific research interests include optimization, computational geometry and topology, approximation algorithms, cryptography and secure computation, network design, data mining, machine learning, finite-element mesh generation, and automatic software verification.