## Organisers:

## Time:

In this talk, I will introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system.

Speaker:

Neha Sangwan, TIFR

Friday, 4 June 2021, 17:15 to 18:15

In this talk, I will introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system.

Vishwas Bhargava

Friday, 28 May 2021, 17:15 to 18:15

The \emph{orbit} of an n-variate polynomial f(\var x) over a field \F, denoted by \orbit{f}, is the set of polynomials obtained by applying invertible affine transformations on the variables of f(\var x), and the orbit of a polynomial class is the

Prof. Arkadev Chattopadhayay (TIFR), Prof. Prahladh Harsha (TIFR), Prof. Mahan Maharaj (TIFR), Prof. Hariharan Narayanan (TIFR), Prof. Jaikumar Radhakrishnan (TIFR)

Wednesday, 19 May 2021, 16:00 to 17:30

Covering Contributions of Abel Laureate Avi Wigderson

Arkadev Chattopadhyay "Games Avi Plays To Prove Hardness"

Prahlad Harsha "How Avi copes with Difficulty: A computational perspective on randomness and knowledge"

Speaker:

Suhail Sherif, TIFR

Monday, 17 May 2021, 17:00 to 18:00

The query model is a simple model of computation that has led to many deep results. One such class of results relates computational complexity measures such as query complexity/communication complexity to algebraic measures such as degree/rank.

Speaker:

Sushant Vijayan, TIFR

Friday, 7 May 2021, 17:15 to 18:15

I will present the 2013 NIPS paper by Dan Russo and Van Roy where they introduce the notion of Eluder dimension and use it to analyse the UCB and Thompson Sampling algorithms.

Henry Yuen

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

Below event would be a screening of a past talk by Henry Yuen (available on YouTube) with the same title.

Avinandan Das

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

In this talk, I am going to present the Singly Connected Vertex Deletion Problem (SCVD).

Nidhi Rathi

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

The theory of Fair Division addresses the fundamental problem of allocating goods among agents with equal entitlements but distinct preferences.

Pavel Dvorak

Thursday, 15 April 2021, 17:45 to 18:45

Network coding conjecture (NCC) by Li and Li asserts that network coding for undirected graphs does not bring any advantage over multicommodity flows.

Speaker:

Anamay Tengse, TIFR

Friday, 9 April 2021, 17:15 to 18:15

The fact that the polynomial (x1+...+xn)^d can be written as a poly(n,d)-sum of products of univariates is a consequence of what is popularly known as 'the duality trick' in the algebraic complexity circles.

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

Dr. Umang Bhaskar joins the School of Technology and Computer Science as a Reader.

Dr. Ashutosh Gupta's paper "Model Checking Gene Regulatory Networks,

- ‹ previous
- 11 of 19
- next ›