## Speaker:

## Organisers:

## Time:

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?

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.

Speaker:

Shubhada Agrawal, TIFR

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

In this talk, we will revisit the classical regret-minimization problem in the multi-armed bandit setting.

Anand Deo

Friday, 30 July 2021, 17:15 to 18:15

Mitigating the effect of tail risk has gained prominence in a variety of applications where safety is of paramount importance.

Thejaswini Raghavan

Friday, 23 July 2021, 17:15 to 18:15

The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor.

Speaker:

Aparna Shankar, TIFR

Friday, 16 July 2021, 17:15 to 18:15

Expander graphs are sparse but highly connected graphs, which find a variety of uses in CS. If the vertices of an expander are labelled by 0 or 1, a $t$-step walk gives a $t$-bit string.