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 2013.


The two day event will consist of talks on recent breakthroughs and the future directions emerging from them.

 

10-11 December 2013

IIT GUWAHATI

Guwahati, INDIA

SPEAKERS


COSTIS DASKALAKIS     MIT


SAMUEL FIORINI            ULB


LAP CHI LAU                  CUHK


JELANI NELSON             Harvard


LORENZO ORECCHIA      MIT


THOMAS ROTHVOSS      MIT


DAVID STEURER              Cornell


RELATED TALKS @ FSTTCS


VENKAT GURUSWAMI (CMU) on Polar Codes - 9am, December 13, 2013

SUBHASH KHOT (NYU) on Approximation Resistant Predicates - 9am, December 14, 2013


TOPICS


- Mechanism Design

- Lower Bounds for Extended Formulations for TSP and Matching Polytopes

- Higher Order Cheeger Inequalities

- Fast Numerical Linear Algebra and Sparse Johnson-Lindenstrauss

- Simple Laplacian Solvers

- Undirected Max-Flow

- Entropy Method and Bin Packing

- Sum-of-Squares and Unique Games Conjecture

- Simple Parallel Repetition

- Directed Max-Flow



PROGRAM & REGISTRATION


Program available here in pdf

Registration can be done through the FSTTCS 2013 website.


ORGANIZERS


AMIT KUMAR & NISHEETH VISHNOI