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

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)

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:

Pritam Bhattacharya, TIFR

Friday, 28 September 2012, 15:00 to 16:30

The main purpose of this talk will be to promote the study of computational aspects, primarily the convergence rate, of non-linear dynamical systems from a combinatorial perspective.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 21 September 2012, 14:30 to 16:00

In this talk we will discuss about the minimum encoding length (bits per symbol) of arbitrary distributed random variables (not necessarily i.i.d) so that they are decoded with arbitrarily small probability of error.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 7 September 2012, 15:00 to 16:30

A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT gates, threshold gates etc.

Speaker:

Rakesh Venkat, TIFR

Friday, 31 August 2012, 15:00 to 16:30

Consider $n$ 'experts' predicting the outcome of, say, the stock market, with errors.