STCS Symposium 2013
25 - 26 March, 2013, Guest House Seminar Hall
Monday, 25 March
09:00 Breakfast
09:30 Shishir Pandey Mutual informationbased output dimensionality reduction
10:00 Prahladh Harsha Communicationcomplexity: a treasurehouse of lower bounds
10:30 Mohit Garg Anupper bound onthenumber of d-dimensional permutations
11:00 Tea Break
11:30 Naqueeb Warsi Operational characterizationof smooth Renyi divergences of order zero and infinity
12:00 Girish Varma Aninvariance principle for NP-hardness reductions
12:30 Swapnil Singone Topic modelling
12:45 Lunch Break
14:00 Rahul Vaze Iterated localizationand bootstrap percolation
14:30 Swagato Sanyal A o(n) monotonicity tester for Booleanfunctions over thehypercube
15:00 Suneel Sarswat Proof ofEuler's formula for planargraphs and its applications
15:15 Abhishek Singh Smalluniversal Turing machine
15:30 Siddhesh Supekar Same size intersection
15:45 Tea Break
16:15 Arkadev Chattopadhyay Lower bounds for interactive compression
16:45 Gugan Thoppe Interactingtwo particle random walk
Tuesday, 26 March
09:00 Breakfast
09:30 Rakesh Venkat Streaminglower bounds onhypergraph 2-coloring
10:00 Naresh Sharma Error exponents and the channel codingtheorems: a short overview
10:30 Pritam Bhattacharya Modellinghumancognition
11:00 Tea Break
11:30 Bodhayan Roy Visibilitygraphs of point sets
12:00 Ankush Agarwal Simulation methods for Bermudanoptionpricingandhedging
12:30 Nithin Varma Onadditive spanners
12:45 Lunch Break
14:00 Paritosh Pandya Model checkers: programs that think about other programs
14:30 Karthyek Rajhaa Efficient simulationof maximum ofheavy-tailed random walks
15:00 Kshitij Gajjar A combinatorial proof of Brouwer's fixed-point theorem
15:15 Anantha Karthik Nanoscale communication with Brownian motion
15:30 Poster Session with Coffee
Sarat Babu Moka Regenerations in multiclass openqueueingnetworks
Tapan Shah Fast inverse lithographyusing machine learning
16:15 Vinod Prabhakaran Secure computation: possibilities and impossibilities
