## Organisers:

## Time:

## Venue:

Abstract: The communication complexity of a function f(x,y) is the number of bits that Alice and Bob need to communicate in order to compute f, when Alice has x and Bob has y.

Speaker:

Suhail Sherif, TIFR

Friday, 2 November 2018, 17:15 to 18:45

Abstract: The communication complexity of a function f(x,y) is the number of bits that Alice and Bob need to communicate in order to compute f, when Alice has x and Bob has y.

Speaker:

Anamay Tengse, TIFR

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

Polynomial identity testing (PIT) is the algorithmic task of determining whether a given polynomial is identically zero.

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.

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]$.

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.

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

Prabhat Jha

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

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

Speaker:

Siddharth Bhandari, TIFR

Friday, 27 July 2018, 17:15 to 18:15

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.