## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

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.

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.

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.

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:

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.

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:

Girish Varma, TIFR

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

We will go through some connections between current flow in an electrical network and the number of spanning trees in the underlying graph.

Nikhil Jayant Joshi

Thursday, 13 September 2012, 16:30 to 17:30

What is the relationship between the complexity and the fitness of evolved organisms, whether natural or artificial?

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.