## Organisers:

## Time:

## Venue:

We will consider the problem of elimination in communication complexity, that was first raised by Ambainis et al. and later studied by Beimel et al. for its connection to the famous direct sum question.

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 2 December 2016, 16:00 to 17:30

We will consider the problem of elimination in communication complexity, that was first raised by Ambainis et al. and later studied by Beimel et al. for its connection to the famous direct sum question.

Sagar Kale

Tuesday, 6 December 2016, 16:00 to 17:00

We develop a paradigm for studying multi-player deterministic communication, based on a novel combinatorial concept that we call a {\em strong fooling set}.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 25 November 2016, 16:00 to 17:30

The isoperiemtric profile of a Graph is a function that measures, for an integer k, is the size of the smallest edge boundary over all sets of vertices of size k.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 18 November 2016, 16:00 to 17:30

The Birkhoff-Von Neumann is a structure theorem characterizing the extremal points of the convex set of doubly stochastic matrices.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 11 November 2016, 16:00 to 17:30

In 1977, J.A. Davis et al showed that any finite subset of natural numbers can be permuted such that it does not contain any 3-term A.P. as a sub-sequence. However, this is not true for the set of all natural numbers.

Tom Hayes

Tuesday, 15 November 2016, 16:00 to 17:00

In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 4 November 2016, 16:00 to 17:30

Peer reviewing is not just an important part of research, but also one of the main characteristics of scientific temper. However, over millions of years, we have evolved into selfish beings, and we attempt to maximize our benefits.

Varsha Dani

Tuesday, 8 November 2016, 16:00 to 17:00

Alice and Bob want to hold a conversation over a noisy channel on which adversarially chosen bits may be flipped. How can they communicate robustly despite such an attack?

Speaker:

Nikhil S Mande, TIFR

Friday, 21 October 2016, 16:00 to 17:30

We consider the unbounded error communication complexity of XOR functions, i.e. those of the form f of XOR, where f is an arbitrary boolean function on n bits.

Speaker:

Varun Narayanan, TIFR

Friday, 14 October 2016, 16:00 to 17:30

DNA sequencing is the basic workhorse of modern day biology and medicine.