## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Abhinav Ganesan

Friday, 3 March 2017, 15:30 to 16:30

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Surender Baswana

Thursday, 16 March 2017, 14:00 to 15:00

Consider the following problem of single source reachability under failures of vertices or edges. Let $G$ be a given directed graph on n vertices with a designated source vertex $s$, and $k$ be any positive integer. Compute the sparsest subgraph

Rakesh Venkat

Friday, 24 February 2017, 16:00 to 17:30

A two-player game is an important construct used in proving many hardness of approximation results.

Speaker:

Sayantan Chakraborty, TIFR

Friday, 17 February 2017, 16:00 to 17:30

The usual idea of compactness of a space is that if the space has an open cover then it has a finite subcover which is not very intuitive. In this talk we attempt to look at some equivalent characterisations of compact spaces.

Rakesh Venkat

Thursday, 23 February 2017, 14:30 to 15:30

Speaker:

Siddharth Bhandari, TIFR

Friday, 10 February 2017, 16:00 to 17:30

I will present a technique know as fast subset convolution for Exact Exponential Algorithms.

Nizar Touzi

Tuesday, 4 April 2017, 16:00 to 17:00

We provide a systematic method for solving general Principal-Agent problems.

Marc Vinyals

Tuesday, 14 February 2017, 16:00 to 17:00

Nowadays SAT solvers are able to solve problems with millions of variables, but some instances are still hard. While some formulas just require large time or memory to solve, other formulas allow to trade these resources.

Jakob Nordstrom

Tuesday, 21 February 2017, 16:00 to 17:00

We study the problem of certifying unsatisfiability of formulas in propositional logic.

Nikhil Karamchandani

Tuesday, 25 April 2017, 16:00 to 17:00

Caching of popular content during off-peak hours is a strategy to reduce the network load during peak hours. We consider a model where multiple caches store pre-fetched content and when users request files, they are matched to caches based on the