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

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.

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.

Abhishek Sinha

Friday, 20 January 2017,

11:30 to 13:00

One of the fundamental problems in Computer Networking is to efficiently transport packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows.

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.

Kuldeep S. Meel

Wednesday, 11 January 2017,

11:00 to 12:30

Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, decision making under certainty, probabilistic reasoning, and constrained-random verification.

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.

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

Swagato Sanyal

Thursday, 5 January 2017,

11:30 to 12:30