## 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

Simoni Shah

Friday, 26 April 2013, 14:30 to 16:00

The class of Unambiguous Star-free regular languages over words has been variously characterized in the past by logics such as the fragments $\Delta_2[<]$ and $FO^2[<]$ of first-order definable languages, Unary Temporal Logic $TL[F,P]$ as we

Speaker:

Gugan Thoppe, TIFR

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

Given an m x n matrix A, we define the rank-k approximation of A as a matrix B of same size and of rank at most k such that A and B are close in the Frobenius norm.

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?

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.

Speaker:

Manoj Gopalkrishnan, TIFR

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

+ Tom Kurtz, in a classic paper from 1972, showed that stochastic models for chemical reactions and deterministic models are related: in the limit of volume going to infinity, the stochastic model approaches the deterministic model.

S.P. Mudur

Wednesday, 10 April 2013, 16:00 to 17:00

A point cloud is an unorganized collection of a very large number of points usually with just their coordinates and no other information.

Speaker:

Sagnik Mukhopadhyay, TIFR

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

In the literature of communication complexity, two models of random protocols are used - common random string model and private random string model.

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