Breakthroughs in theoretical Computer Science

 
 

This event aims to disseminate and discuss major advances in theoretical computer science. The target audience is advanced students and researchers interested in theoretical computer science. It will be co-located with FSTTCS 2011.


The two day event will consist of talks by prominent researchers on what they consider recent breakthroughs in their areas of expertise and the future directions emerging from them.

 

15-16 December 2011

IIT BOMBAY

Mumbai, INDIA

SPEAKERS


MANINDRA AGRAWAL                 IIT Kanpur


NAVEEN GARG                           IIT Delhi


SANJEEV KHANNA                      U Penn


AMIT KUMAR                             IIT Delhi


ALEKSANDER MADRY                   MSR New England and EPFL


JAIKUMAR RADHAKRISHNAN      TIFR Mumbai


MADHU SUDAN                           MSR New England


UMESH VAZIRANI                       UC Berkeley


NISHEETH VISHNOI                      MSR Bangalore

TOPICS


Circuit Lower Bounds for NEXP, Traveling Salesman Problem, Routing Edge Disjoint Paths, Lower Bounds for Randomized Simplex, Fast Algorithms for Max-Flow, Online Algorithms for the k-Server Problem,  Direct Sum Theorems in Communication Complexity, Locally Decodable Codes, Quantum Randomness, Unique Games Conjecture.



PROGRAM


Available Here



REGISTRATION


Anyone can register by paying a fee of Rs 1000 at the venue. However, due to limited seats, we cannot guarantee registration on the spot. Hence, we strongly encourage that you send an email indicating this  to btcs11mumbai@gmail.com by December 13, 2011.


ORGANIZERS


AMIT KUMAR & NISHEETH VISHNOI