## Organisers:

## Time:

## Venue:

## Webpage:

The permanent of a doubly stochastic matrix is at least that of the matrix with each entry $1/n$ (the matrices are $n x n$).

Speaker:

Mohit Garg, TIFR

Friday, 19 July 2013, 14:30 to 16:00

The permanent of a doubly stochastic matrix is at least that of the matrix with each entry $1/n$ (the matrices are $n x n$).

Murad Banaji

Tuesday, 6 August 2013, 16:00 to 17:00

Networks of chemical reactions have natural underlying combinatorial structure, allowing them to be represented as graphs or digraphs, perhaps with additional vertex or edge colourings/labellings.

K. Narayan Kumar

Wednesday, 17 July 2013, 10:30 to 11:30

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 12 July 2013, 14:30 to 16:00

We consider two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players differ significantly.

Simoni Shah

Monday, 15 July 2013, 11:00 to 12:30

Speaker:

Sarat Babu Moka, TIFR

Friday, 5 July 2013, 14:30 to 16:00

A stylized model of one-dimensional stochastic root-finding involves repeatedly querying an oracle as to whether the root lies to the left or right of a given point $x$.

Sumeet Agarwal

Wednesday, 26 June 2013, 14:30 to 15:30

150 years after Darwin's seminal theory, there are many aspects of biological evolution that remain fascinatingly mysterious. We still have little understanding of its powers and limits: how complex is the functionality that biology can evolve?

Speaker:

Shishir Pandey, TIFR

Friday, 21 June 2013, 14:30 to 16:00

Decision trees are used in machine learning a lot. In this talk I will give a brief introduction to decision trees.

Speaker:

Kshitij Gajjar, TIFR

Friday, 14 June 2013, 14:30 to 16:00

We know that every regular language is context-free but a context-free language need not be regular.

Kamal Lodaya

Wednesday, 12 June 2013, 11:00 to 12:00

A little over 50 years ago (1962), we had the first nontrivial theorem which used an algebraic approach to automata theory: Schuetzenberger's theorem giving an algorithm to check whether a given regular language is definable using a starfree expre