Algorithms and Theory of Computation
The design and analysis of efficient algorithms and discovering the intrinsic complexity of computational problems is at the core of computer science. Approximation and randomized algorithms, optimization, computational geometry and topology, algorithms for big data, distributed algorithms, and communication protocols are some of the topics of active investigation in Theory and Algorithms.
Faculty
Amit Chakrabarti
Deeparnab Chakrabarty
Hsien-Chih Chang
Prasad Jayanti
Daniel Rockmore
Peter Winkler