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

Elisa Celis

Friday, 26 October 2018, 10:00 to 11:00

**Abstract:** Social systems are now fueled by algorithms that facilitate and control connections and information. Simultaneously, computational systems are now fueled by people -- their interactions, data, and behavior.

Nisheeth Vishnoi

Friday, 26 October 2018, 11:15 to 12:15

**Abstract:** In understanding physical systems over hundreds of years, physicists have developed a wealth of dynamics and viewpoints.

Ness Shroff

Monday, 29 October 2018, 11:30 to 12:30

**Absract:** Network Utility Maximization has been studied for resource allocation problems in communication networks for nearly two decades.

Gugan Thoppe

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

Abstract: A function's excursion set is the sub-domain where its value exceeds some threshold. Some key examples illustrating the central role that excursion sets play in different application areas are as follows.

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.

Saravanan Kandasamy

Tuesday, 16 October 2018, 14:00 to 15:00

Abstract: We consider testing and learning problems on causal Bayesian networks as defined by Pearl. Given a causal Bayesian network M on a graph with n discrete variables and bounded in-degree and bounded ``confounded components'', we show tha

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.

Himanshu Asnani

Monday, 15 October 2018, 14:30 to 15:30

**Abstract:** The problem of ascertaining conditional independence or dependence is central to causal discovery and statistical inference in several dynamical systems, such as gene regulatory networks, fi