## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory.

Rahul Jain

Monday, 14 August 2017, 16:00 to 17:00

Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory.

Speaker:

Siddharth Bhandari, TIFR

Friday, 11 August 2017, 17:15 to 18:15

A recent powerful method has been independently developed by Saxton and Thomason (2012) and by Balogh, Morris, Samotij (2014).

Krishnamurthy Iyer

Friday, 11 August 2017, 16:00 to 17:00

We consider the problem of optimal information sharing in the context of a service system. In particular, we consider an unobservable single server queue offering service at a fixed price to a Poisson arrival of delay-sensitive customers.

Madhu Sudan

Wednesday, 9 August 2017, 14:30 to 15:30

A martingale is a sequence of random variables that maintain their future expected value conditioned on the past. A $[0,1]$-bounded martingale is said to polarize if it converges in the limit to either $0$ or $1$ with probability $1$. A martinga

Rohit Gurjar

Tuesday, 1 August 2017, 16:00 to 17:00

We present a geometric approach towards derandomizing the Isolation lemma for a given family, i.e., deterministically constructing a weight assingnment which ensures a unique minimum weight set in the family.

Speaker:

Deepesh Data, TIFR

Monday, 31 July 2017, 16:00 to 17:00

Information theoretically secure multi-party computation (MPC) has been a central primitive of modern cryptography, in which mutually distrusting parties collaborate to compute a function of their private data without revealing any additional info

Speaker:

Suhail Sherif, TIFR

Friday, 28 July 2017, 17:15 to 18:15

We look at the boolean function in which the input is a boolean matrix with the promise that either 2/3rd of its rows contain a 1 or 2/3rd of its rows do not contain a 1.

Rajesh Sundaresan

Thursday, 27 July 2017, 11:00 to 12:00

The talk will be on load balancing on a large graph. A unit of load on each edge of a graph is to be distributed between its nodes in a balanced way. On infinite graphs, it is known that the problem exhibits nonuniqueness.

Arijit Ghosh

Wednesday, 26 July 2017, 16:00 to 17:00

The packing lemma of Haussler (J. of Comb. Theory, Ser. A, 1995) states that given a set system with bounded VC dimension, if every pair of sets in the set system have large symmetric difference, then the set system cannot contain too many sets.

Speaker:

Anand Deo, TIFR

Friday, 21 July 2017, 17:15 to 18:15

Discrete default intensity based or logit type models are commonly used as reduced form models for conditional default probabilities for corporate loans where this default probability depends upon macroeconomic as well as firm-specific covariates.

Dr. Ashish Tendulkar joins the School of Technology and Computer Science as a Visiting Fellow. Ashish is interested in machine learning and text mining from large data repositories.

Dr. Vinod M. Prabhakaran joins the faculty of the School of Technology and Computer Science as a Reader.

- ‹ previous
- 16 of 17
- next ›