## Organisers:

## Time:

## Venue:

## Webpage:

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)·

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)·

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

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.

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:

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.

Speaker:

Swagato Sanyal, TIFR

Friday, 12 October 2012, 14:00 to 15:00

This talk will be an introduction to pseudorandomness. We will motivate it's study and connect it to 'unpredictability' through a theorem by Yao.

Reference: Computational Complexity, Arora and Barak, chapter 20 (Derandomization)

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.

Speaker:

Ankush Agarwal, TIFR

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

We will see how multigrid ideas can be used to reduce the computational complexity (computational cost) of estimating an expected value arising from the solution of a stochastic differential equation using Monte Carlo path simulations.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Tuesday, 9 October 2012, 15:30 to 16:30

In this talk we will discuss about linear information inequalities, both discrete and continuous ones.

Ashutosh K. Gupta

Friday, 12 October 2012, 15:30 to 16:30

Various verification methods depend on theorem provers to obtain proofs of verification conditions. If the provers return proofs that satisfy certain structure then it may enhance the performance of the verification methods.