## Speaker:

## Organisers:

## Time:

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.

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.

Amey Bhangale

Tuesday, 31 August 2021, 16:00 to 17:00

Raghavendra's famous result from 2008 fully characterizes the inapproximability of every maximum constraint satisfaction problem (Max-CSP). However, the result inherently loses perfect completeness.

Speaker:

Aparna Shankar, TIFR

Friday, 27 August 2021, 15:00 to 16:00

The multiplicity Schwartz-Zippel lemma provides a bound on the total multiplicity of zeroes of a low-degree polynomial within a product set.

Speaker:

Varun Ramanathan, TIFR

Friday, 27 August 2021, 14:00 to 15:00

Paper: Michael Saks and Rahul Santhanam, "Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions"

https://drops.dagstuhl.de/opus/volltexte/2020/12578/

Speaker:

Friday, 27 August 2021, 12:00 to 13:00

Paper: Nikhil R. Devanur, Zhiyi Huang. "Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms"

https://dl.acm.org/doi/abs/10.1145/3155297

Speaker:

Hari Krishnan P A, TIFR

Friday, 27 August 2021, 11:00 to 12:00

"Paper: Yuchen Zhang, John C Duchi, Michael I Jordan, Martin J Wainwright, Information-theoretic lower bounds for distributed statistical estimation with communication constraints"

The paper, "Network Speed Scaling" co-authored by Dr.

Neha Sangwan, graduate student in the School of Technology and Computer Science, has been awarded

- ‹ previous
- 5 of 27
- next ›