## Organisers:

## Time:

## Venue:

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

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.

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, 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.

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:

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.

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.

Manoj M. Prabhakaran

Tuesday, 18 October 2016,

16:00 to 17:00

We introduce a new information-theoretic complexity measure IC∞ for 2-party functions which is a lower-bound on communication complexity, and has the two leading lower-bounds on communication complexity as its natural relaxations: (external) infor

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.

Speaker:

Gunjan Kumar, TIFR

Friday, 7 October 2016,

16:00 to 17:30

We present algorithmic applications of an approximate version of Caratheodory's theorem.

Speaker:

Anamay Tengse, TIFR

Friday, 30 September 2016,

16:00 to 17:30

The max-coloring problem is to compute a legal coloring of the vertices of a graph $G=(V,E)$ with vertex weights $w$ such that $sum^k_{i=1} max_{v \in C_i} w(v_i)$ is minimized, where $C_1, \ldots ,C_k$ are the various color classes.