## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

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$.

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.

N. Hemachandra

Tuesday, 16 April 2013, 15:00 to 16:00

We propose a model for interaction between an user-set (market) and a service-provider (firm) when the offered demand is sensitive to the offered Quality of Service.

Himanshu Tyagi

Tuesday, 2 April 2013, 11:00 to 12:00

Information theoretic secrecy provides a framework for exploring schemes that guarantee provable unconditional security in network systems. This talk explores innate structural connections that exist between the information theoretic notion of mul

Speaker:

Girish Varma, TIFR

Friday, 15 March 2013, 14:30 to 16:00

Elections are a way of aggregating preferences made by individual voters and making a choice for the whole.

Jakob Nordström

Wednesday, 13 March 2013, 15:30 to 16:30

An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size and space.

Xavier Viennot

Tuesday, 26 February 2013, 16:00 to 17:00

The following is reproduced from Doron Zeilberger's page:

http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/bordelaise.html.

Xavier Viennot

Wednesday, 27 February 2013, 16:00 to 17:00

Computer scientists defined the Strahler number of a binary tree in relation with the minimum number of registers needed for the computation of an arithmetical expression.

Milind Sohoni

Tuesday, 26 February 2013, 14:30 to 15:30

Markets are of course, one of the oldest mechanism of exchanging commodities and cultural artifacts. While their history is over 5000 years old, their mathematical theory is rather recent. The first such models were by Fisher and Walras.