Homepage of the SIGTACS - Spring 2012
SIGTACS - Special Interest Group on Theoretical Aspects of Computer Science, was born out of an effort to bring together people interested in areas of Theoretical Computer Science. It is a platform for students and faculty members to come together and share their excitement in the area. The group aims at organizing problem solving sessions, seminars and guest lectures.
SIGTACS Lecture Series
The topic for this semester's seminar series is yet to be decided. This page shall be updated once we have decided on a topic.
SIGTACS Seminar Series
SIGTACS would continue to hold seminars this semester on various
areas of algorithm and complexity theory.
Meeting Schedule
(unless mentioned otherwise)Venue: CS102
Time: 10:30am
Every Saturday
Upcoming Talks
Recent (past) Talks
- Communication Complexity and PRGs 31th Mar '12
- Perfect Matching in bipartite planar graphs 17th Mar '12
- Determinant and iterated matrix product 26th Feb '12
- The Polynomial Method and applications to coding theory 19th Feb '12
- Valiant's theorem 11th Feb '12
- Fooling Polynomials 5th Feb '12
- An approach to Information Theory through prediction games 28th Jan '12
- Deterministic polynomial factoring under the assumption of ERH 21th Jan '12
- A deterministic algorithm for k-SAT 14th Jan '12
Recent blog posts
- SIGTACS session this week 10th Nov 10
- Subspace polynomials 7th Oct 10
- Laplacian of a graph 19th Sep 10
- Fooling Compositions 24th Aug 10
- Goodstein's Theorem 19th Aug 10