## Speaker:

## Time:

## Venue:

A boolean function f on N variables is called evasive if its decision tree complexity is N, i.e., one must query *all* the variables (in worst case) in order to decide if f(X) = 1.

Raghav Kulkarni
University of Chicago
1100 E 58th Street
Chicago, IL 60637
United States of America
http:

Thursday, 17 September 2009 (All day)

A boolean function f on N variables is called evasive if its decision tree complexity is N, i.e., one must query *all* the variables (in worst case) in order to decide if f(X) = 1.

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

Wednesday, 16 September 2009 (All day)

I propose to give a series of lectures explaining the recent paper by Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and John Watrous showing that the class of problems having quantum interactive proofs is the same as the class of problems having cla

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.

Sandeep Juneja
TIFR

Wednesday, 2 September 2009 (All day) to Saturday, 5 September 2009 (All day)

Samarjit Chakraborty
Lehrstuhl fur Realzeit-Computersysteme
Technische Universitat
Germany
http://www.rcs.ei.t

Friday, 28 August 2009 (All day)

Lately, there has been a considerable amount of interest in design methodologies for embedded systems that are specifically targeted towards stream processing, e.g., audio/video applications and control applications processing sensor data.

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.

Sasanka Roy
Indian Institute of Science
Bangalore 560012
http://www.csa.iisc.ernet.in/people/people-postdoc.php

Tuesday, 25 August 2009 (All day)

A path from $s$ to $t$ on a polyhedral terrain is descending if the height of a point $p$ never increases while we move p along the path from $s$ to $t$.

Abhay Parekh
University of California, Berkeley
Department of Electrical Engineering
and Computer Sciences
20

Friday, 21 August 2009 (All day)

Cloud Computing has recently received more attention than many exciting Page 3 notables. It is a model of distributed computation which promises to provide huge benefits to application providers and their users.

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.