Algorithms Group UIUC
A special Interest Group of ACM also known as SIGACT
Information:
Upcoming Events:
Contact:
sigact@acm.uiuc.edu
About Us: This is an online discussion forum for latest development in algorithms. The topics for discussion are essentially blogs in which people can share ideas or talk about research papers. We hold monthly informal meetings, and are planning a for STOC conferences this year as representatives of UIUC.
Who we are: A group in ACM of UIUC CS
What we do: A forum for online discussion of the latest research in algorithms.
Where we meet: World Wide Web
When : 24/7
Why: To promote interest in algorithms and complexity research.
Topics for discussion:
1. Sorting and Searching
2. Genetic Algorithms
3. Randomized Heuristics
4. Approximation Algorithms
5. NP-completeness and how to deal with it.
6. Space Complexity
7. Computational Neuroscience
8. Recursion
9. Hashing
10. Basic Distributed and Parallel algorithms
11. Algorithmic Information Theory
12. Other techniques(Tabu search, cryptography, communication complexity)
Last Update: September 1st, 2006