## Speaker:

## Time:

## Venue:

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.

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.

Jay Sethuraman
Industrial Engineering and Operations Research
Columbia University
United States of America
htt

Monday, 17 August 2009 (All day)

We survey the classical multi-armed bandit problem and discuss several variations such as the problem of stochastic search in a forest and the union branching bandit problem.

N.V. Narendra Kumar
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha R

Friday, 7 August 2009 (All day)

In this talk we will try to understand how we can protect ourself against computer viruses.

Arijit Chakrabarty
Cornell University
Rhodes Hall, Ithaca
United States of America

Monday, 3 August 2009 (All day)

We address the important question of the extent to which random variables and vectors with truncated power tails retain the characteristic features of random variables and vectors with power tails.

Shishir Pandey
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<

Friday, 31 July 2009 (All day)

Given 3 or more non-collinear points on a plane how many distinct slopes to these points define on the plane? We will prove the following theorem.

Joseph Cheriyan
University of Waterloo
Canada
http://www.math.uwaterloo.ca/~jcheriya/

Wednesday, 29 July 2009 (All day)

A typical problem in network design is to find a subgraph H of a given graph G such that H satisfies some connectivity requirements and has minimum cost.

Sanjay Kumar Singh
School of Mathematics
Tata Institute of Fundamental Research
Homi Bhabha Road
Mumbai 40000

Friday, 24 July 2009 (All day)

The classification theorem of closed surfaces states that any closed surface is homomorphic to some member of one of these three families:

Manoj M. Prabhakaran
Department of Computer Science
University of Illinois at Urbana-Champaign
United States of Am

Monday, 20 July 2009 (All day)

Cryptographic primitives often define controlled access to (learning and influencing) information, permitting some kind of access while denying others.

Chinmoy Dutta
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Friday, 17 July 2009 (All day)

We will discuss the MCMC method. We will talk about approximately counting the number of satisfying assignments of a DNF formula, approximately counting the number of independent sets in a graph, and (time permitting) the Metropolis Algorithm.

Subir Kumar Ghosh
School of Technology & Computer Science, Tata Institute of Fundamental Research, Mumbai 400005.

Wednesday, 15 July 2009 (All day) to Saturday, 18 July 2009 (All day)