## Speaker:

## Time:

## Venue:

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.

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.

Rahul Jain
University of Southern California
Viterbi School of Engineering, EEB-328
Los Angeles, CA 90089-256
<br/

Friday, 21 May 2010 (All day)

The scarcity of spectrum is becoming an impediment to the growth of more capable wireless networks.

Rajmohan Rajaraman
Northeastern University
College of Computer & Information Science
Boston, MA 02115
United

Thursday, 20 May 2010 (All day)

In a landmark paper, Papadimitriou introduced several syntactic subclasses of the search class TFNP (Total Function Nondeterministic Polynomial) based on proof styles that (unlike TFNP) admit complete problems.

Sumeet Sandhu
Intel Corporation
2200 Mission College Blvd.
Santa Clara
California 95054-1549
United Stat

Monday, 17 May 2010 (All day)

We will present a broad range of longer-term research at Intel Labs, ranging from sensing/perception to networking to exascale computing.

Kishor Barman
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<b

Friday, 14 May 2010 (All day)

We will discuss a lower bound (due to Noga Alon) on the rank of any real matrix in which all the diagonal entries are significantly larger (in absolute value) than all the other entries.

Kishore Barman
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<

Friday, 30 April 2010 (All day)

An under-determined system of linear equation has infinitely many solutions (if it has a solution).