## Organisers:

## Time:

## Venue:

**Abstract:** Given two discrete random variables $X$ and $Y$, how much information does $Y$ leak about $X$?

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 5 October 2018, 17:15 to 18:15

**Abstract:** Given two discrete random variables $X$ and $Y$, how much information does $Y$ leak about $X$?

Speaker:

Anand Deo, TIFR

Friday, 21 September 2018, 17:15 to 18:15

**Abstract:** Assume that we have to move a load of coal from source pile A to destination pile B, both of whose shape we know, and whose capacities are identical.

Himanshu Asnani

Monday, 15 October 2018, 14:30 to 15:30

**Abstract:** The problem of ascertaining conditional independence or dependence is central to causal discovery and statistical inference in several dynamical systems, such as gene regulatory networks, fi

Speaker:

Prerona Chatterjee, TIFR

Friday, 14 September 2018, 17:15 to 18:15

Abstract: Suppose we are given a set of $k$ polynomials, $f_1, \ldots, f_k \in \mathbb{F}[x_1, \ldots, x_n]$.

Mohit Garg

Monday, 17 September 2018, 10:00 to 11:00

Abstract: The submodular welfare maximization problem (SWM) captures an important subclass of combinatorial auctions and has been extensively studied in various settings.

Speaker:

Shubhada Agrawal, TIFR

Friday, 7 September 2018, 17:15 to 18:15

Abstract : The stochastic multi-armed bandit model is a simple abstraction that has been proven useful in many different contexts in statistics and machine learning. The problem is studied in a number of settings.

Alexandre Reiffers-Masson

Tuesday, 4 September 2018, 16:00 to 17:00

In this presentation, we adapt mathematical tools and models from Telecommunication Networks to Online Social networks.

Speaker:

Tulasi mohan Molli, TIFR

Wednesday, 29 August 2018, 17:15 to 18:15

A probabilistic polynomial is like a randomized algorithm. It is a distribution on polynomials such that, for each input, the probabilistic polynomial computes the function exactly with high probability.

Vishwas Bhargava

Friday, 24 August 2018, 17:15 to 18:15

In this talk, we describe a new type of probabilistic algorithm (introduced by Gat and Goldwasser [GG11]) called Pseudo-deterministic Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time and to produce a correc

Arup Bose

Friday, 31 August 2018, 14:30 to 15:30