UT Algorithms and Computational Theory Group

Algorithms and Computational Theory Group, Fall 2003

Research Themes

The algorithms and computational theory (ACT) group focuses on the theoretical foundations of computer science. The current research interests of faculty in the group include algorithm design, complexity theory, parallel and distributed computation, graph theory, randomized computation, computational learning theory, probabilistic methods and combinatorics. 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

Algorithms and Complexity

Anna Gal (panni"at"cs.utexas.edu) --- Computational complexity; lower bounds; fault tolerant computing; randomness and computation; algorithms; combinatorics.
Adam Klivans (klivans"at"cs.utexas.edu) --- Computational Learning Theory; computational complexity; randomness and computation; cryptography.
Greg Plaxton (plaxton"at"cs.utexas.edu) --- Analysis of algorithms and theory of parallel computation.
Vijaya Ramachandran (vlr"at"cs.utexas.edu) --- Algorithm design and analysis; parallel computation; machine models; graph theory, graph algorithms and data structures.
David Zuckerman (diz"at"cs.utexas.edu) --- Randomness and computation; complexity theory; random walks; graph theory; cryptography.

Applied Algorithms

Tandy Warnow (tandy"at"cs.utexas.edu) --- Computational biology; phylogenetics.

Students and Postdocs

Rezaul Alam Chowdhury (shaikat"at"cs.utexas.edu)
Ned Dimitrov (ned"at"cs.utexas.edu)
Jeff Ford (jeffford"at"cs.utexas.edu)
Ganeshkumar Ganapathy (gsgk"at"cs.utexas.edu)
Dan Fernholz (fernholz"at"cs.utexas.edu)
Jing-Tang Keith Jang (keith"at"cs.utexas.edu)
Jesse Kamp (kamp"at"cs.utexas.edu)
Andy Mills (amills"at"cs.utexas.edu)
Anindya Patthak (anindya"at"cs.utexas.edu)
Anup Rao (arao"at"cs.utexas.edu)
Alex Sherstov (sherstov"at"cs.utexas.edu)
Vladimir Trifonov (vladot"at"cs.utexas.edu)

Former Students and Postdocs

Tugkan Batu (batu"at"cs.utexas.edu)
Sanjoy Baruah (sanjoy"at"cs.unc.edu)
Tsan-sheng Hsu (tshsu"at"iis.sinica.edu.tw)
Pierre Kelsen (pierre.kelsen"at"ist.lu)
Madhukar Korupolu (madhukar"at"cs.utexas.edu)
Phil MacKenzie (philmac"at"research.bell-labs.com)
Ramgopal Mettu (ramgopal"at"cs.dartmouth.edu)
Luay Nakhleh (nakhleh"at"cs.utexas.edu)
Seth Pettie (seth"at"cs.utexas.edu)
C. K. Poon (ckpoon"at"cs.cityu.edu.hk)
Rajmohan Rajaraman (rraj"at"ccs.neu.edu)
Usman Roshan (usman"at"cs.utexas.edu)
Alex Russell (acr"at"cse.uconn.edu)
Santanu Sinha (ssinha"at"cs.utexas.edu)
Srinath Sridhar (srinath"at"cs.cmu.edu)
Torsten Suel (suel"at"photon.poly.edu)
Li-San Wang (lswang"at"mail.med.upenn.edu)
Yuke Zhao (yuke"at"cs.stanford.edu)

Seminar Series

The ACT Seminar meets on Fridays at 11, and features research talks, problem solving sessions, and discussion of recent theory research results.

This first meeting for Fall 2004 is at 11 a.m. on Friday, September 10, in ACES 3.408

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. If you live in the Austin area you can add yourself to this mailing list by sending an e-mail message to vlr"at"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 udb"at"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.