Past Events

Limiting Distributional Fixed Points in Systemic Risk Graph Models.

Speaker: 
Anand Deo, TIFR

Organisers: 

Tulasi mohan Molli

Time: 

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

Venue: 

Abstract: We analyse the equilibrium behaviour of a large network of banks in presence of incomplete information, where inter-bank borrowing and lending is allowed, and banks suffer shocks to assets.

Approximate Unitary $n^{2/3}$-Designs Give Rise to Quantum Channels with Superadditive Classical Holevo Capacity

Speaker: 
Aditya Nema, TIFR

Organisers: 

Gowtham Raghunath Kurri

Time: 

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

Venue: 

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

Communication Complexity of Randomness Manipulation

Speaker: 

Madhu Sudan

Organisers: 

Prahladh Harsha

Time: 

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

Venue: 

Webpage: 

http://madhu.seas.harvard.edu/

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.

New Algorithmic Guarantees for Searching in Large Datasets

Speaker: 

Samuel McCauley

Organisers: 

Umang Bhaskar

Time: 

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

Venue: 

Webpage: 

http://mccauleysam.com/

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? 

Pages