## Organisers:

## Time:

## Venue:

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

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.

Rajesh Chitnis

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

The classical approach for designing algorithms measures the time complexity only as a measure of the input size.

Speaker:

Suhail Sherif, TIFR

Friday, 30 December 2016, 16:00 to 17:30

Lee and Zhang showed that the communication complexity of "f composed with g" is high when f is hard to approximate with a low degree polynomial (also g has to be from a good class of functions, more details will be given in the talk).

Speaker:

Deepesh Data, TIFR

Friday, 23 December 2016, 16:00 to 17:30

Characterization of securely computable two-party functions is one of the most fundamental problem in cryptography.