## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** The concept of a blockchain was invented by Satoshi Nakamoto to maintain a distributed ledger for an electronic payment system, Bitcoin.

Sreeram Kannan

Wednesday, 26 December 2018, 11:00 to 12:00

**Abstract:** The concept of a blockchain was invented by Satoshi Nakamoto to maintain a distributed ledger for an electronic payment system, Bitcoin.

Speaker:

Marc Vinyals, TIFR

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

Abstract: Randomness can provide an exponential saving in the amount of communication needed to solve a distributed problem, and the canonical example of this is equality.

Speaker:

Vidya Sagar Sharma, TIFR

Friday, 30 November 2018, 17:15 to 18:15

Abstract: It is well known that multi-player potential game is PLS-complete.We show that constant player potential game is also PLS-complete.We also show that,there exist a constant-player potential game with some initial strategy such that it can

Speaker:

Suhail Sherif, TIFR

Tuesday, 27 November 2018, 14:00 to 15:00

Abstract: The Log-Approximate-Rank Conjecture was a long-standing conjecture which posited that the randomised communication complexity of a function and log of the approximate rank of its communication matrix are polynomially related.

Anindya De

Tuesday, 11 December 2018, 14:00 to 15:00

**Abstract:** Motivated by the problem of feature selection in machine learning, the problem of testing juntas, i.e., checking if a Boolean function on the n-dimensional hypercube only depends on k<<n coordinates, has attracted

Aristotle Arapostathis

Thursday, 22 November 2018, 16:00 to 17:00

**Abstract:** We study ergodic properties of multiclass multi-server queues, which are uniform over scheduling policies, as well as the size n of the system. The system is heavily loaded in the Halfin-Whitt regime, and the scheduling

Ramya C.

Wednesday, 21 November 2018, 16:00 to 17:00

**Abstract: **Polynomials are the most fundamental mathematical objects in algebra and it is compelling to understand the complexity of computing polynomials. That is, given a polynomial we want to understand the number of arithmetic

Speaker:

Anamay Tengse, TIFR

Friday, 16 November 2018, 16:00 to 17:00

**Abstract: **A polynomial $f(x_1,\ldots,x_n)$ is said to be an identity for $m \times m$ matrices if $f(M_1,\ldots,M_n) = 0$ for all choices of $m \times m$ matrices for $M_i$s.

Speaker:

Gunjan Kumar, TIFR

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

In the problem of partial function extension, we are given a partial function consisting of a set of $n$ points in a domain and a function value at each point.

Amit Apte

Tuesday, 20 November 2018, 14:00 to 15:00

Data assimilation refers to the problem of estimation of state of a high dimensional chaotic system given noisy, partial observations of the system.