## Organisers:

## Time:

## Venue:

## Webpage:

Isolation lemma is a technique used in randomized algorithms to reduce the number of solutions of a problem to one, should a solution exis

Speaker:

Girish Varma, TIFR

Friday, 1 June 2012, 15:00 to 16:30

Isolation lemma is a technique used in randomized algorithms to reduce the number of solutions of a problem to one, should a solution exis

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 25 May 2012, 15:00 to 16:30

Suppose you are trying to build a circuit using limited number of AND, OR, NOT gates to compute some boolean function $f$ over inputs in $\{0,1\}^n$.

Speaker:

Tapan Shah, TIFR

Friday, 18 May 2012, 15:00 to 16:30

I will introduce the problem of mask design in a lithographic process from a systems perspective and show how it can be reduced to a non-linear optimization problem.

Speaker:

Ankush Agarwal, TIFR

Friday, 11 May 2012, 15:00 to 16:30

In this talk, we will see how to use variational inequalities to solve a particular optimal stopping problem under certain conditions on the underlying diffusion processes.

Speaker:

Simoni S. Shah, TIFR

Friday, 27 April 2012, 15:00 to 16:30

The two key timed logics studied in literature are TPTL and MTL.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 20 April 2012, 16:00 to 17:30

To describe searching in its simplest abstract setting, suppose we have some accumulated data (called the 'file') and some new data item (called the 'sample'). Then, searching consists of relating the sample to the file.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 16 March 2012, 15:00 to 16:30

This talk is based on "Simple channel coding bounds" by Wang et al, ISIT, 2009. New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel.

Speaker:

Tapan Shah, TIFR

Friday, 2 March 2012, 15:00 to 16:30

I will introduce a very simple social interaction model of information transmission, opinion formation and consensus formation by De Groot. We will study sufficient and necessary conditions to converge to a consensus in very simple networks.

Speaker:

Tapan Shah, TIFR

Monday, 28 November 2011, 16:00 to 17:00

Suppose we want to cluster scientists into different groups such that in each group scientists have some research interest in common. The data available to us is the coauthor relationships. How do we classify using spectral clustering ?

Speaker:

Girish Varma, TIFR

Monday, 14 November 2011, 16:00 to 17:00

Determining the chromatic number of a graph is known to be NP-hard. We will consider the problem of coloring a $k$-colorable graph on n vertices with $n^{\alpha}$ colors (where $\alpha < 1$).