## Speaker:

## Time:

## Venue:

Suppose Prof. N is giving Mr. M an exam, and Mr. M doubts that a question on the exam paper is wrong. Mr. M asks Prof. N about it. Naturally Prof.

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

Friday, 10 July 2009 (All day)

Suppose Prof. N is giving Mr. M an exam, and Mr. M doubts that a question on the exam paper is wrong. Mr. M asks Prof. N about it. Naturally Prof.

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

Friday, 3 July 2009 (All day)

The notion of communication complexity (CC) was introduced by Yao in 1979, who investigated the following problem involving two separated parties (Alice and Bob).

Jaikumar Radhakrishnan
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabh

Friday, 26 June 2009 (All day)

We will study computations performed with limited memory. This will bring us into contact with several ideas in the area of randomness and computation. We will illustrate these ideas using the following toy example.

Dharma P. Agrawal
Department of Computer Science and Engineering
University of Cincinnati
United States of America

Thursday, 25 June 2009 (All day)

Mesh networks have become increasingly important because they can be easily implemented without much infrastructure and can support adequate bandwidth with a flexible multi-hop wireless communication among their routers serving the clients.

Benny George K.
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road

Friday, 19 June 2009 (All day)

XZ=ZY is called the conjugacy equation. Given languages X and Y we are interested in knowing if there exists a non empty language Z which makes this equation true. This problem is undecidable in the general setting.

Pranab Sen
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhaba Road
<

Tuesday, 16 June 2009 (All day)

Suppose we have a polynomial $P$ in variables $X_1, \\ldots, X_n$ with coefficients from a field $F$, with total degree at most $d$. The polynomial $P$ is given in terms of some algebraic expression involving $X_1, \\ldots, X_n$.

Satyadev Nandakumar
Iowa State University
USA
http://www.cs.iastate.edu/~satyadev

Friday, 12 June 2009 (All day)

Using Kolmogorob Complexity, we will prove that there exist an oracle with respect to which $P$ not equal to $NP$.

Satyadev Nandakumar
Department of Computer Science
Iowa State University
United States of America
http://www.c

Thursday, 11 June 2009 (All day)

My talk focuses on two aspects of my thesis, in the theory of algorithmic randomness.

Manoj Gopalkrishnan
School of Technology and Computer Science
TIFR

Wednesday, 10 June 2009 (All day)

I shall describe two approaches to the study of self-assembly. The first approach involves experiments with DNA molecules. We use DNA like a construction material --- akin to the uses of brick, cement, glass, etc. --- to form nanostructures.