## Speaker:

## Time:

## Venue:

We will try to answer the above question by analyzing the stopping times (which is the time after which the deck of cards is completely random) of the card shuffling process.

G. Varma
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
Mu

Friday, 18 September 2009 (All day)

We will try to answer the above question by analyzing the stopping times (which is the time after which the deck of cards is completely random) of the card shuffling process.

Sudarshan Gurjar
School of Mathematics
Tata Institute of Fundamental Research
Homi Bhabha Road
Mumbai 400005<

Friday, 11 September 2009 (All day)

The torus is one of the most important geometrical objects in mathematics. As a topological space it is just a product of two circles. The is a natural continuous mapping from the real plane to the torus which is called the exponential map.

Saswata Shannigrahi
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha R

Wednesday, 26 August 2009 (All day)

We will try to find an upper bound on the number of edges in a graph with no k pairwise crossing edges.

Kishor Barman
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Wednesday, 19 August 2009 (All day)

Suppose there is a graph G, whose vertices are letters in an alphabet A and in which adjacency means that the letters can be confused in a transmission.

Bodhayan Roy
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<br

Friday, 26 February 2010 (All day)

For problems that are NP hard, till now we have nothing better than algorithms with exponential running times to obtain the optimal solution.