## Speaker:

## Organisers:

## Time:

## Venue:

Suppose we are given a list of numbers and we wish to determine whether it is sorted in increasing order. That problem obviously requires reading the entire list.

Sofya Raskhodnikova

Tuesday, 25 February 2014, 10:00 to 11:00

Suppose we are given a list of numbers and we wish to determine whether it is sorted in increasing order. That problem obviously requires reading the entire list.

Manjunath Krishnapur

Monday, 24 February 2014, 16:00 to 17:00

Abstract: An infinite graph may have the property that two independent random walks on the graph never meet each other, although each of them visits every vertex of the graph infinitely often.

Deepak Kapur

Friday, 21 February 2014, 16:00 to 17:30

Abstract: Program invariants play an important useful role in understanding programs as well as verifying properties about them.

Krishna B. Athreya

Friday, 14 February 2014, 11:00 to 12:00

Abstract: Let B be standard Brownian motion. Fix an interval (a,b). Condition on B(t) to be in (a,b). Look at B(u) for u<.=t and B(u) u>.=t. We show that this converges weakly to a proper probability measure on C(R).

Krishna B. Athreya

Thursday, 13 February 2014, 14:30 to 16:30

Abstract: We will start with the classical Albert - Barabasi model of preferential attachment random graphs.

Krishna B. Athreya

Thursday, 13 February 2014, 11:00 to 12:00

Abstract: Propp and Wilson showed how to generate a Markov chain which in a finite number of steps gives a sample from the stationary distribution supported by a countable set.

Thursday, 13 February 2014, 09:00 to Monday, 17 February 2014, 18:00

Arithmetic Complexity is a central topic of interest in theoretical computer science. The famous $P$ vs. $NP$ question that seeks to understand the limits of efficient computation has its natural arithmetic analogue.

Ravi Palla

Tuesday, 11 February 2014, 11:30 to 12:30

Abstract: Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency.

Shravan M. Hanasoge

Monday, 10 February 2014, 16:00 to 17:00

Abstract: The inference of the interior properties of the Sun and Earth using surface measurements of the seismic wavefield are active areas.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 7 February 2014, 14:30 to 16:00

Abstract: Most of the achievability proofs in Information theory are based on the concept of typicality. However, this typicality technique does not seem to be good enough to give achievability bounds in the most general settings, i.e.