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
- Compact Linear Programming Formulations 12 Jan '13
- Perfect Matching in Regular Bipartite Graphs 06 Jan '13
- Arithmetic Branching Programs 29 Dec '12
- Disjoint Block Entropy is equal to Sliding Window Entropy 22 Dec '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
Past SIGTACS Seasons
- Fall - 2012
- Spring - 2012
- Spring - 2011
- Fall - 2010
- Spring - 2010
- Fall - 2009
- Spring - 2009
- Fall - 2008