## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: An abstract set system, or hypergraph, consists of a universe (here assumed finite), together with a subset of its power set.

Kunal Dutta

Friday, 5 December 2014, 14:00 to 15:30

Abstract: An abstract set system, or hypergraph, consists of a universe (here assumed finite), together with a subset of its power set.

Speaker:

Girish Varma, TIFR

Friday, 21 November 2014, 14:00 to 15:30

Abstract: In this talk, we will go through some of the results in the paper "Communication with Imperfectly Shared Randomness <http://arxiv.org/abs/1411.3603

Speaker:

Deepesh Data, TIFR

Friday, 14 November 2014, 14:00 to 15:30

Abstract: In two-party secure computation, Alice has an input X, Bob has an input Y and both of them want to compute a function $f:\mathcal{X} \times \mathcal{Y} \to \mathcal{Z}$ securely by exchanging messages to each other over several rounds.

Ronak M. Soni

Friday, 31 October 2014, 14:00 to 15:30

Abstract: Correlations, as you know, is not causation; in fact, a vast majority of correlations aren't causal.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 24 October 2014, 14:00 to 15:30

Abstract: A set S is said to be 3-term A.P free if there are no elements in S which form a 3-term A.P.In first part of talk, we will see a greedy way of constructing a 3-term A.P free set S.In the later part, we state and prove Behrend's theorem w

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 17 October 2014, 14:00 to 15:30

Abstract: We consider the tollbooth pricing problem where the input is a tree with

Speaker:

Suhail Sherif, TIFR

Friday, 10 October 2014, 14:00 to 15:30

Abstract: In the first half of this talk, I will talk about the halting problem and show that there are well defined functions f:N->N that no computable function can dominate.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 26 September 2014, 14:00 to 15:30

Abstract: The VERTEX GUARD (VG) problem is defined as follows: Given a polygon P (with holes allowed) with n vertices, find a smallest subset S of the set of vertices of P such that every point in the polygon P can be

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 19 September 2014, 14:00 to 15:30

Abstract: We discuss a proof of the classical CLT (in Wasserstein metric) using Stein's Lemma.

Satwik Mukherjee

Friday, 22 August 2014, 14:00 to 15:30

Abstract: I will sketch the proof as given by C. Reiher.