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

Krishna Athreya

Monday, 25 July 2016, 16:00 to 17:00

Karl Weierstrass showed that given a continuous function $f$ on $[0,1]$ and an epsilon positive, there is a polynomial $p$ such that it is uniformly epsilon close to $f$ on $[0,1]$.

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?

Speaker:

Paritosh K Pandya, TIFR

Thursday, 23 June 2016, 14:30 to 15:30

Musical sounds and their compositions can be analysed and synthesised using digital signal processing techniques. Computers are now increasingly used in editing, processing and even synthesis of music.

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.

Ness B. Shroff

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

We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every two days.

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