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

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

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?

Santosh Nagarakatte

Friday, 5 August 2016, 15:00 to 16:00

Peephole optimizations perform local rewriting to improve the efficiency of the code input to the compiler.

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.

Anirban Dasgupta

Tuesday, 24 May 2016, 11:00 to 12:00

A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error;approximate modularity is the set analog of approximate linearity.

Speaker:

Swagato Sanyal, TIFR

Friday, 20 May 2016, 10:30 to 11:30

Boolean functions are central to computer science. This presentation will focus on Boolean functions from the perspective of certain measures of complexity.