## Organisers:

## Time:

## Venue:

Algebraic Complexity Theory is a field in which one studies complexity theoretic questions surrounding algebraic objects. In this talk we will be broadly discussing two such problems.

Speaker:

Prerona Chatterjee, TIFR

Friday, 26 November 2021, 17:30 to 18:30

Algebraic Complexity Theory is a field in which one studies complexity theoretic questions surrounding algebraic objects. In this talk we will be broadly discussing two such problems.

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.

Dr.Hariharan Narayanan joins the School of Technology and Computer Science as a Reader. Hariharan's research interests

Dr.Piyush Srivastava joins the School of Technology and Computer Science as a Reader.Piyush's research is on probabili

Dr. Ramprasad Saptharishi joins the School of Technology and Computer Science as a Reader.

- ‹ previous
- 12 of 20
- next ›