## Speaker:

## Organisers:

## Time:

We consider the problem of dividing indivisible resources among a set of agents ``fairly''.

Bhaskar Ray Chaudhury

Tuesday, 23 November 2021, 17:30 to 18:30

We consider the problem of dividing indivisible resources among a set of agents ``fairly''.

Sarang Deo

Tuesday, 16 November 2021, 16:00 to 17:00

Many low- and middle-income countries face limited supply of vaccines. In such situations it is imperative to devise vaccination rollout strategies that maximize the cost-effectiveness of these limited vaccine stocks.

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.

Uma Girish

Tuesday, 28 September 2021, 19:00 to 20:00

We give a new proof of the fact that the parallel repetition of the (3-player) GHZ game reduces the value of the game to zero polynomially quickly.

Abhishek Sinha

Tuesday, 21 September 2021, 16:00 to 17:15

Optimal resource allocation in networks gives rise to some of the most fundamental problems at the intersection of algorithms, stochastic processes, and learning.

Shibashis Guha’s paper titled “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct”, co-authored with Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann won the best paper award at the 46th International Symposium on Mathematical Foundations

Three (3) graduate students from STCS, Prerona Chatterjee, Shubhada Agrawal and Sayantan Chakraborty, win the 2021 Google PhD Fellowship in Algorithms, Optimizations and Markets; Machine Learning and Quantum Computing respectively.

The following paper authored by former faculty members of TIFR received the prestigious IEEE RTS 2020 Test-of-Time Award, jointly with three other papers.

- ‹ previous
- 2 of 18
- next ›