## Organisers:

## Time:

## Venue:

## Webpage:

As with other areas of computer science, lower bounds play an essential role in the field of property testing. The question can be posed as follows.

Speaker:

Sagnik Mukhopadhyay, TIFR

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

As with other areas of computer science, lower bounds play an essential role in the field of property testing. The question can be posed as follows.

Speaker:

Karthyek Rajhaa A M, TIFR

Friday, 24 May 2013, 14:30 to 16:00

In the context of scheduling in networks, we have the famous max-weight scheduling policy which mi

Sathya Peri

Wednesday, 22 May 2013, 16:00 to 17:00

There has been considerable interest in Software Transactional Memory in recent years. The reason for rise in STM is due to rise of multicore computers.

Vivek Sarkar

Wednesday, 22 May 2013, 11:00 to 12:00

The two dominant paradigms for scientific discovery have historically been theory and experiments, with large-scale simulations emerging as the third paradigm in the 20th century.

Speaker:

Nithin M. Varma, TIFR

Friday, 17 May 2013, 14:30 to 16:00

Consider a finite set $V$ and a function $d: V \times V \rightarrow \mathbb{R}$ such that $(V,d)$ forms a metric space.

Sriram Rajamani

Tuesday, 21 May 2013, 11:30 to 12:30

Probabilistic models, particularly those with causal dependencies, can be succinctly written as probabilistic programs.

D. Yogeshwaran

Tuesday, 14 May 2013, 11:00 to 12:00

The field of topological data analysis has received attention in the recent years and a key object of study are random simplicial complexes.

Dominik Wojtczak

Friday, 10 May 2013, 14:30 to 15:30

I will survey the state of the art in the automated analysis of several classes of probabilistic infinite-state systems which naturally arise when studying probabilistic programs with recursive calls, queueing systems, population dynamics

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.