## Speaker:

## Time:

## Venue:

As computer systems support more aspects of modern life, from finance to health care, security becomes increasingly important.

Indrajit Roy
University of Texas at Austin
Department of Computer Science
University Station, Austin
United S

Monday, 21 December 2009 (All day)

As computer systems support more aspects of modern life, from finance to health care, security becomes increasingly important.

Vijay Subramanian
Hamilton Institute
NUI Maynooth
Co Kildare
Ireland
http://www.hamilton.ie/vsubramanian/

Monday, 21 December 2009 (All day)

We consider a single-server discrete-time system with $K$ users where the server picks operating points from a compact, convex and coordinate convex set in $\\Re_+^K$.

Naresh Sharma
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Tuesday, 8 December 2009 (All day)

We study the fundamental properties of the quantum f-relative entropy, where f(.) is an operator convex function.

Ajesh Babu
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road

Friday, 27 November 2009 (All day)

Consider the set of all n-vertex graphs that does not contain a k-clique. What is the maximum number of edges that any graph in this set have?

Nutan Limaye
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<br

Friday, 20 November 2009 (All day)

The number of perfect matchings in planar graphs can be computed in polynomial (in the number of vertices) time.

Rakesh Venkat
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Friday, 13 November 2009 (All day)

A classic counting algorithm, Kirchhoff's theorem gives a formula for finding the number of spanning trees in a simple, connected, undirected graph. I will discuss a simple proof of this theorem, based on elementary linear algebra.

Kishor Baman
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<br

Thursday, 5 November 2009 (All day)

We'll discuss an information theoretic proof of the Kahn's theorem that upper bounds the number of independent sets of a regular bi-partite graph.

Girish Varma
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<br

Friday, 23 October 2009 (All day)

Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods), are a class of algorithms for sampling from probability distributions based on constructing a Markov chain that has the desired distribution as its equilibriu