Day 1: August 17, 2012 (Friday) (Venue: PBCEC)
| 9:45 | Welcome |
| 10:00-11:00 | Eric Allender, Investigations Concerning the structure of Complete sets. |
| 11:00-11:30 | Coffee |
| 11:30-12:30 | Vinodchandran Variyam, On the space complexity of the Graph Reachability problem. |
| 12:30-14:00 | Lunch |
| 14:00-15:00 | Jaikumar Radhakrishnan, Information theory and computation complexity |
| 15:00-15:30 | Coffee |
| 15:30-16:15 | Nutan Limaye Estimating frequency moments on distributed networks |
| 16:15-17:00 | Jayalal Sarma On Isomorphism Testing of Polynomials |
| 17:00-18:00 | Prahladh Harsha Low error 2-query PCPs via composition |
Day 2: August 18, 2012 (Saturday) (Venue: CS101)
| 10:00-11:00 | Osamu Watanabe Analysis of generic algorithm lower bounds |
| 11:00-11:30 | Coffee |
| 11:30-12:30 | Bruno Poizat “Malod & Pascaline” |
| 12:30-14:00 | Lunch |
| 14:00-15:00 | Markus Blaeser, On the complexity of the noncommutative determinant |
| 15:00-15:30 | Coffee |
| 15:30-16:15 | Ragesh Jaiswal, On the Distribution of the Fourier Spectrum of Halfspaces |
| 16:15-17:15 | Felicitation of Somenath Biswas |
| 19:30 | Workshop dinner |
Day 3: August 19, 2012 (Sunday) (Venue CS101)
| 10:00-11:00 | Meena Mahajan, Enumerating languages by verifying proofs |
| 11:00-11:30 | Coffee |
| 11:30-12:30 | K.V. Subrahmanyam, Towards equipping GL(2m) modules with a GL(2) × GL(m) action. |
| 12:30-13:00 | Closing session |
| 13:00-14:00 | Lunch and goodbye |