## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

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.

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.

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.

Vijay G. Subramanian

Thursday, 24 November 2016, 14:00 to 15:00

The threshold model is widely used to study the propagation of opinions and technologies in social networks. In this model individuals adopt the new behavior based on how many neighbors have already chosen it.

Andrew Thangaraj

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

Characterising the capacity of channels with memory is a challenging and interesting problem in information theory. One example is a channel with an input runlength constraint.

Sandeep Sen

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

We develop new techniques for rounding packing integer programs using iterative randomized rounding. It is based on a novel application of multidimensional Brownian motion in $\mathbb{R}^n$.

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.