## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

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

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

Speaker:

Rahul Vaze, TIFR

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

In a breakthrough, we are able to give a simple description of 'capacity' of cellular wireless networks. Shannon capacity is intractable for most wireless networks, and a surrogate definition is used.

Speaker:

Piyush Srivastava, TIFR

Friday, 27 January 2017, 16:00 to 17:30

Consider a system consisting of a binary "stimulus" variable X, (e.g. whether an individual consumes tobacco), a binary "response" variable Y, (e.g.

Venkatesan Guruswami

Wednesday, 25 January 2017, 17:00 to 19:00

A subspace design is a (large) collection of subspaces of F_q^n, each of small co-dimension, such that for any low-dimensional subspace W, only a small number from the collection have a non-trivial intersection with W.

Sayan Bhattacharya

Tuesday, 31 January 2017, 16:00 to 17:00

We consider the problem of maintaining a matching and a vertex cover of approximately maximum (resp. minimum) size in a dynamic graph under a sequence of edge insertions and deletions.

Speaker:

Kshitij Gajjar, TIFR

Friday, 20 January 2017, 16:00 to 17:30

An n × n Latin square is a grid with n rows and n columns such that each cell of the grid is filled with one number from the set {1,2,...n} and no number is repeated in any row or any column.

Speaker:

Abhishek Singh, TIFR

Friday, 13 January 2017, 16:00 to 17:30

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Swagato Sanyal

Friday, 6 January 2017, 16:00 to 17:30

Linear sketch complexity of a Boolean function f on a set of n inputs, introduced by Kannan, Mossel and Yaroslavtsev, is, in informal terms, the smallest integer d such that the value of the function can be concluded with high probability from the

Venkatesan Guruswami

Tuesday, 24 January 2017, 16:00 to 17:00

Error-correcting codes play a crucial role in safeguarding data against the adverse effects of noise during communication and storage. They are also powerful tools that underlie several advances in theoretical computer science.