## Organisers:

## Time:

## Venue:

Boolean functions capture various problems and situations arising in computer science and other areas. In this synopsis, we study boolean functions using two complexity measures.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 15 July 2022, 14:00 to 15:00

Boolean functions capture various problems and situations arising in computer science and other areas. In this synopsis, we study boolean functions using two complexity measures.

Speaker:

Varun Narayanan, TIFR

Monday, 18 January 2021, 11:00 to 12:00

Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography.

Speaker:

Anamay Tengse, TIFR

Monday, 23 November 2020, 11:15 to 12:15

We study the question of constructing _hitting sets_ for polynomials computed by several algebraic models.

Speaker:

Gunjan Kumar, TIFR

Tuesday, 20 October 2020, 14:00 to 15:00

Partial function extension is a basic problem that underpins multiple research topics in optimization, including learning, property testing, and game theory.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 15 November 2019, 11:00 to 12:00

**Abstract:** In a coordination problem, users in a network observing correlated inputs collaborate to evaluate possibly randomized functions of the inputs.

Speaker:

Kshitij Gajjar, TIFR

Friday, 4 January 2019, 17:15 to 18:15

**Abstract: **Computing and maintaining shortest paths is a fundamental problem in computer science.

Speaker:

Nikhil S Mande, TIFR

Tuesday, 17 April 2018, 16:00 to 17:30

Given a boolean function $f : \{0, 1\}^n \rightarrow \{0, 1\}$ define the function $f \circ \mathsf{XOR}$ on $2n$ bits by $f \circ \mathsf{XOR} (x_1, \dots, x_n, y_1, \dots, y_n) = f(x_1 \oplus y_1, \dots, x_n \oplus y_n)$. Such a function is cal

Speaker:

Deepesh Data, TIFR

Monday, 31 July 2017, 16:00 to 17:00

Information theoretically secure multi-party computation (MPC) has been a central primitive of modern cryptography, in which mutually distrusting parties collaborate to compute a function of their private data without revealing any additional info

Speaker:

Sagnik Mukhopadhyay, TIFR

Thursday, 1 June 2017, 10:30 to 11:30

In the first part, we will consider the connection between two well-known complexity measures --- communication complexity and query complexity.

Speaker:

Sarat Babu Moka, TIFR

Wednesday, 21 September 2016, 11:30 to 12:30

As is well known, Monte Carlo methods are ubiquitous in many applied domains. One of the main uses of these methods is to study the long-time behavior of stochastic systems of interest.