## Speaker:

## Time:

## Venue:

We prove a $\\#$NC$^1$ upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton.

Andreas Krebs
Universitat Tubingen
Wilhelm-Schickard-Inst. fur Informatik
Arbeitsbereich Theoretische
Informa

Thursday, 8 July 2010 (All day)

We prove a $\\#$NC$^1$ upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton.

Navin Kashyap
Queen's University
Department of Mathematics and Statistics
Kingston, Ontario
Canada K7L 3N6<br

Monday, 5 July 2010 (All day)

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear local constraint codes to be associated with the edges and vert

Manoj Gopalkrishnan
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha R

Friday, 2 July 2010 (All day)

If networks of chemical reactions are the circuits of biology then catalysts are the transistors, or perhaps switches. But which species should be called catalysts? Come to the talk and find out.

Apurva Mudgal
Indian Institute of Technology, Ropar
Department of Computer Science and
Engineering
Nangal Roa

Monday, 28 June 2010 (All day)

Localization is a fundamental problem in robotics. The kidnapped robot possesses a compass and map of its environment it must determine its location at a minimum cost of travel distance.

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

Monday, 28 June 2010 (All day)

The speaker will discuss three puzzles in this talk and using ideas from theoretical computer science try to find answers for them.

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

Friday, 25 June 2010 (All day)

In formal languguage theory, regularity is a robust notion having many equivalent representations: regular expressions, ï¬nite state automata, MSO etc. These have made important impact on programming and veriï¬cation tools.

Rahul Roy
Indian Statistical Institute
Stat. Math. Unit
7, S.J.S. Sansanwal Marg
New Delhi 110016
http://

Monday, 21 June 2010 (All day)

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

Friday, 4 June 2010 (All day)

Algorithms working on large data(say of size n) should be both space and time efficient. Any algorithm has to see atleast the whole data once, so time required has to be atleast n(see sublinear time algorithms for exceptions).

Kamal Lodaya
Institute of Mathematical Sciences
CIT Campus
Tharamani
Chennai 600 113
http://www.imsc.res.

Friday, 28 May 2010 (All day)

Petri net theory has nice theorems which relate subclasses of Petri nets defined by structural conditions -- for example T-nets (also known as marked graphs) and free choice nets -- to their behavioural properties -- such as checking, given a net

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

Friday, 28 May 2010 (All day)

Computer scientists devise randomized algorithms when they cannot find good deterministic ones. Then they try to decrease the randomness used and still try to prove that the algorithm answers correctly with high probability.