## Organisers:

## Time:

## Venue:

Abstract:

The $delta$-coin problem asks if a given function can distinguish between coins which are sampled independently with the probability of heads being $1/2+ \delta$ and those where the probability of heads is 1/2.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 21 June 2019, 17:15 to 18:15

Abstract:

The $delta$-coin problem asks if a given function can distinguish between coins which are sampled independently with the probability of heads being $1/2+ \delta$ and those where the probability of heads is 1/2.

Speaker:

Kshitij Gajjar, TIFR

Friday, 14 June 2019, 17:15 to 18:15

**Abstract:** Given a graph $G$ with one source vertex $s$ and several target vertices, a shortest path tree rooted at $s$ is a subgraph of $G$ that preserves distances from $s$ to each of the target vertices.

Kartik Nagar

Thursday, 8 August 2019, 14:30 to 16:00

Speaker:

Aditya Nema, TIFR

Friday, 31 May 2019, 17:15 to 18:15

**Abstract:** In a breakthrough, Hastings(2009) showed that there exists quantum channels whose classical Holevo capacity is superadditive i.e.

Madhu Sudan

Wednesday, 29 May 2019, 11:00 to 12:00

Abstract: The task of manipulating randomness has been a subject of intense investigation in computational complexity with dispersers, extractors, pseudorandom generators, condensers, mergers being just a few of the objects of interest.

Speaker:

Suhail Sherif, TIFR

Friday, 24 May 2019, 17:15 to 18:15

**Abstract: **The first observation that one makes when analyzing communication protocols between Alice and Bob is that a cost c protocol partitions the input space into 2^c combinatorial rectangles.

Samuel McCauley

Monday, 20 May 2019, 14:00 to 15:00

**Abstract:** Many recent advancements in computation have come from harnessing the power of very large sets of data. This leads to an algorithmic question: how can we store a large dataset so that we can quickly query it later on?

Speaker:

Suhail Sherif, TIFR

Friday, 10 May 2019, 17:15 to 18:15

**Abstract:** In December 2001, David Moews held a programming contest to see whose short C program would return the largest number on a theoretical computer where the int datatype has no bounds.

Speaker:

Neha Sangwan, TIFR

Friday, 3 May 2019, 17:15 to 18:15

**Abstract:** A famous result of Ahlswede in the theory of Arbitrarily Varying Channels (AVCs) stated that the deterministic coding capacity of an AVC is either zero or is equal to its random coding capacity.

Abhishek Khetan

Friday, 19 April 2019, 16:00 to 17:00

**Abstract: **In this talk, we will state an prove the Minkowski's convex body theorem and see how it can be applied to prove Dirichlet's theorem on (simultaneous) diophantine approximation and to prove the fact that if p is prime wit