UT Algorithms and Computational Theory Group

The algorithms and computational theory group focuses on the theoretical foundations of computer science. The current research interests of faculty in the group include algorithm design, complexity theory, parallel computation, graph theory, and probabilistic methods. A major focus of the group is on the design and analysis of provably efficient algorithms for solving fundamental computational problems, where efficiency can be measured in terms of different resources such as time, space, number of processors, and number of random bits.

Faculty



Affiliated Folks

(Postdocs, students, alumni, etc.)

The `algorithms' Mailing List

The algorithms mailing list is an electronic mailing list on which announcements related to seminars and activities in theoretical computer science in Austin and surrounding areas are posted. This is a low volume mailing list with typically no more than a dozen messages a semester. You can add yourself to this mailing list by sending an e-mail message to vlr@cs.utexas.edu expressing your interest in being added to the algorithms mailing list. You can remove your name from this mailing list at any time by sending a message requesting removal to gripe@cs.utexas.edu.

ACM SIGACT

SIGACT stands for the ACM Special Interest Group on Algorithms and Computational Theory. This is a very active group that includes many distinguished computer scientists. SIGACT sponsors the ACM Symposium on Theory of Computing (STOC) and is a co-sponsor of the ACM-SIAM Symposium on Discrete Algorithms (SODA) and the ACM Symposium on Parallel Algorithms and Architectures (SPAA). Other important conferences of interest are the IEEE Symposium on the Foundations of Computer Science (FOCS) and the IEEE Symposium on Computational Complexity.

Useful Pointers