## Speaker:

## Organisers:

## Time:

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!

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.

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.

Arun Maiti

Tuesday, 7 September 2021, 16:00 to 17:00

Tiling of a surface is acted upon by its automorphism group. The tilings with single vertex orbit, the transitive tilings, are well studied since antiquity.

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.

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 ›