## Organisers:

## Time:

## Venue:

## Webpage:

Imagine a secret agent in a terrorist camp who needs to get messages to the outside world.

Speaker:

Rakesh Venkat, TIFR

Friday, 30 November 2012, 15:00 to 16:30

Imagine a secret agent in a terrorist camp who needs to get messages to the outside world.

Prof. Steven Lumetta & Prof. Ravishankar Iyer

Tuesday, 27 November 2012, 16:00 to 17:00

The next major innovations in computer science and engineering are likely to come from [UTF-8?]â€œintelligentâ€ deployment of human-centric systems that must optimally interact with other man-made and natural s

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 23 November 2012, 15:00 to 16:30

In this talk we will discuss the rate distortion theory from the viewpoint of the information-spectrum so that we can treat arbitrary general sources (not necessarily memoryless and stationary)·

Madhu Sudan

Tuesday, 20 November 2012, 14:00 to 15:00

Most natural communication among humans is characterized by a lack of perfect understanding among the communicating players.

Naama Barkai

Friday, 16 November 2012, 14:30 to 16:30

Individuals of the same or closely related species can vary substantially in size. However, the proportions within (and between) tissues are precisely kept.

Speaker:

Nithin M. Varma, TIFR

Friday, 9 November 2012, 15:00 to 16:30

Given an undirected unweighted graph $G$, a \beta-additive spanner of $G$ is a subgraph H of G in which the shortest distance between any pair of vertices is stretched within an additive factor \beta of their shortest distance in $G$.

Amitabh Trehan

Tuesday, 6 November 2012, 16:00 to 17:00

Given a connected graph, two players play a turn-based game: First. the red guy removes a node (and therefore, its adjoining edges too), now the blue guy adds edges between the remaining nodes.

Speaker:

Ankush Agarwal, TIFR

Friday, 2 November 2012, 15:00 to 16:30

In this talk, I'll discuss the pathwise optimization (PO) method for stochastic control problem. We will first see how the method produces upper and lower bounds on the optimal value of a high-dimensional optimal stopping problem.

Speaker:

Shishir Pandey, TIFR

Friday, 19 October 2012, 15:00 to 16:30

The four-color theorem states that it is always possible to color the regions of a plane map with four colors such that regions that share a boundary receive different colors. This theorem was proven in 1976 by Appel and Haken.

Rahul Roy

Friday, 19 October 2012, 10:00 to 11:00

Let $G$ be a random graph generated as follows:- each vertex $i$ of the vertex set $\{1,\ldots,n\}$ has an associated random variable $X_i$ where $\{X_i : i \ge 1\}$ are i.i.d.