## Organisers:

## Time:

## Venue:

One of the famous open problems in randomized query complexity is the composition question: Is R(f o g) = Omega(R(f)R(g)) for all boolean functions f and g.

Speaker:

Suhail Sherif, TIFR

Friday, 29 July 2016, 16:00 to 17:30

One of the famous open problems in randomized query complexity is the composition question: Is R(f o g) = Omega(R(f)R(g)) for all boolean functions f and g.

Aditya Potukuchi

Friday, 22 July 2016, 16:00 to 17:30

In this talk, I would like to attempt to give a brief glimpse at and around the recent developments related to the Cap Sets problem:

Speaker:

Anamay Tengse, TIFR

Friday, 15 July 2016, 16:00 to 17:30

In this talk, we will discuss subcubic equivalence between the following problems:

Speaker:

Tulasi mohan Molli, TIFR

Friday, 8 July 2016, 16:00 to 17:30

In this talk we will see an efficient parallel algorithm for the Bipartite Perfect Matching problem (BPM) due to Fenner, Gurjar and Thierauf. The Perfect Matching problem (PM) is to decide whether a given graph has a perfect matching.

Speaker:

Sarat Babu Moka, TIFR

Friday, 24 June 2016, 16:00 to 17:30

Let X_1, X_2, ... ,X_n be, possibly dependent, [0,1]-valued random variables. The following question is important: What is a sharp upper bound on the probability that their sum is significantly larger (or significantly smaller) than their mean?

Pritam Bhattacharya

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

The general Art Gallery Problem (AGP) consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon.

Speaker:

Rakesh Venkat, TIFR

Friday, 3 June 2016, 16:00 to 17:30

Given a matrix A which is n x m, the image of A (viewed as a linear operator) is the space spanned by its m columns {c_1, ..., c_m} .

Speaker:

Varun Narayanan, TIFR

Friday, 27 May 2016, 16:00 to 17:30

A randomized algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space was proposed by Martin Dyer, Alan Frieze and Ravi Kannan in 1988.

Abhishek Behera

Friday, 13 May 2016, 16:00 to 17:30

In this talk we will introduce the optimal transportation problem and mention some of its applications. We will then present the duality theory for the optimal transportation problem.

Speaker:

Nikhil S Mande, TIFR

Friday, 6 May 2016, 16:00 to 17:00

We will talk about the notion of the sign-rank of a {-1, 1}-valued matrix, which measures the robustness of it's rank under sign preserving changes. We will first see a neat geometric interpretation of the sign-rank, and then see how showing an u