Page type: project

UT Algorithms and Computational Theory Group;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; Greg Plaxton (plaxton@cs.utexas.edu); --- Parallel computation; algorithm design and analysis; combinatorics;;lower bounds; randomization.; Vijaya Ramachandran (vlr@cs.utexas.edu); --- Parallel computation; algorithm design and analysis; machine models;;graph theory and graph algorithms.; David Zuckerman (diz@cs.utexas.edu); --- Randomness and computation; complexity theory; random walks;; graph theory; cryptography.; Affiliated Folks (Postdocs, students, alumni, etc.); Sanjoy Baruah (sanjoy@emba.uvm.edu); Tsan-sheng Hsu (tshsu@iis.sinica.edu.tw); Pierre Kelsen (kelsen@mpi-sb.mpg.de); Madhukar Korupolu (madhukar@cs.utexas.edu); Phil MacKenzie (philmac@cs.idbsu.edu); Ramgopal Mettu (ramgopal@cs.utexas.edu); C. K. Poon (ckpoon@cs.utexas.edu); Rajmohan Rajaraman (rraj@cs.utexas.edu); Santanu Sinha (ssinha@cs.utexas.edu); Torsten Suel (suel@cs.berkeley.edu); Yuke Zhou (yuke@cs.utexas.edu); 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 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.; WARM;WARM stands for the Workshop on Algorithms Research in the;Midsouth (or Midsouthwest). This is a forum;for researchers in theoretical computer science in Texas and;surrounding states that meets once or twice a year at different;locations. Each meeting consists of several talks by researchers;in the region on their recent research results. Often there is;a distinguished keynote speaker.;;The first WARM was organized by Vijaya Ramachandran at;UT Austin in the Spring of 1990. Greg Plaxton organized;another WARM at UT Austin in Fall 1994. WARM has been held;at several other locations including Texas A&M, UT Dallas,;Southern Methodist University, University of North Texas,;Louisiana State University, University of Southwestern Louisiana;and University of Oklahoma. The next WARM is scheduled to be;held at UT Dallas on November 9, 1996.;Program announcements about WARM are sent out on the algorithms;mailing list when they become available. Also, we usually;try to car-pool to attend WARM when it takes place outside of;Austin. Announcements regarding these arrangements are also;sent out on the algorithms mailing list.;; 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.;Vijaya Ramachandran serves as an elected member of the;SIGACT Executive Committee.;; Useful Pointers; ACM SIGACT; Theory Calendar;;ECCC - The Electronic Colloquium on Computational Complexity;;TCS Virtual Rolodex;;Bibliographies on Theory/Foundations of Computer Science;;MIT Hypertext Bibliography Project; U.S. Universities; UT Dept. of Computer Sciences;