## Organisers:

## Time:

In a secure multi-party computation problem, players are required to compute a function of their private inputs without revealing any extra information about this input to other players.

Speaker:

Hari Krishnan P A, TIFR

Friday, 12 November 2021, 17:15 to 18:15

In a secure multi-party computation problem, players are required to compute a function of their private inputs without revealing any extra information about this input to other players.

Kshitij Gajjar

Friday, 5 November 2021, 17:15 to 18:15

You have n candidates to fill up n vacant positions in an office. The question is which candidate gets which position? To decide this, you ask non-candidates to vote. There are n!

Speaker:

Pranshu Gaba, TIFR

Friday, 29 October 2021, 17:15 to 18:15

A Simple Stochastic Game is a game with a reachability objective played by two players on a directed graph. Each vertex of the graph is either controlled by one of the players or is a probabilistic vertex.

Speaker:

Varun Ramanathan, TIFR

Friday, 22 October 2021, 17:15 to 18:15

The Minimum Circuit Size problem is a fundamental problem in theoretical computer science, connecting cryptography, learning theory, structural complexity, etc., One of the longstanding open problems is whether determining the size of a smallest c

Varun Narayanan

Friday, 8 October 2021, 17:15 to 18:15

Can a sender encode a pair of messages (m0, m1) jointly, and send their encoding over (say) a binary erasure channel, so that the receiver can decode exactly one of the two messages and the sender does not know which one?

Kshitij Gajjar

Friday, 1 October 2021, 17:15 to 18:15

How does one store a graph in the database? Typically the vertices are labelled by a set {1, 2, ..., n}. The edges can be denoted in many different ways: adjacency matrix, incidence matrix, adjacency list, to name a few.

Speaker:

Anamay Tengse, TIFR

Friday, 17 September 2021, 17:15 to 18:15

We know that for matrices A and B, AB is not the same as BA in general. But suppose B is a polynomial in A, like B = A^2 - 3A + I (note I = A^0). Then AB is indeed the same as BA.

Sumanta Ghosh

Friday, 3 September 2021, 17:15 to 18:15

A pseudo-deterministic NC algorithm for a search problem is an RNC algorithm that, for a given input, outputs a fixed solution with high probability.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 20 August 2021, 17:15 to 18:15

A p-random restriction is a random partial input obtained by independently leaving each input variable unset with probability p setting them to either 0,1 with (1-p)/2 each.

Speaker:

Kumar Saurav, TIFR

Friday, 13 August 2021, 17:15 to 18:15

We consider a node where packets of fixed size are generated at arbitrary intervals.