## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: Large-scale data mining of private information (such as medical or financial records) has the potential to revolutionize the way we live.

Anand Dilip Sarwate

Thursday, 17 October 2013, 16:00 to 17:00

Abstract: Large-scale data mining of private information (such as medical or financial records) has the potential to revolutionize the way we live.

Mr. Ankit Garg

Tuesday, 10 September 2013, 14:30 to 15:30

We study the relation between public and private-coin information complexity.

Prof. Ronnie Sircar

Thursday, 5 September 2013, 16:00 to 17:00

We study continuous time Bertrand competition in which a large number of firms producing similar goods compete with one another by setting prices.

Tim Byrnes

Thursday, 5 September 2013, 14:30 to 15:30

Spin coherent states are the matter equivalent of optical coherent states, where a large n

Ankur Kulkarni

Thursday, 6 June 2013, 11:00 to 12:00

A deletion channel is communication medium that takes a string of symbols as input, deletes a fixed number of them and outputs the remaining symbols by aligning them without changing their order.

Deeparnab Chakrabarty

Thursday, 2 May 2013, 15:30 to 16:30

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is monotone if $f(x) \geq f(y)$ whenever $x > y$, that is, all coordinates of $x$ dominate those of $y$.

Abdul Sattar

Monday, 29 April 2013, 10:30 to 11:30

Since the emergence of Artificial Intelligence (AI) as a new field of modern science and engineering about 6 decades ago, concerted efforts have been made on designing and developing expressively adequate languages to represent knowledge about re

Nikhil Srivastava

Monday, 6 May 2013, 16:30 to 17:30

We prove that there exist infinite families of bipartite Ramanujan graphs of every degree bigger than 2. We do this by proving a variant of a conjecture of Bilu and Linial about the existence of good 2-lifts of every graph.

Speaker:

Sagnik Mukhopadhyay, TIFR

Wednesday, 17 April 2013, 09:30 to 11:30

We investigate the following question: If NP contains functions which are slightly hard to compute on average then does NP also contain function which is very hard to compute on average?