## Speaker:

## Time:

## Venue:

Memory, in its most generic form, is an object, a process, an idea and an enigma.

Shobo Bhattacharya

Friday, 24 May 2013, 16:00 to 17:00

Memory, in its most generic form, is an object, a process, an idea and an enigma.

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.

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.

Krithi Ramamritham

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

Smart grids have been heralded as the key enabler of cleaner, cheaper and more reliable energy. They incorporate diverse energy sources, advanced monitoring, demand-side management and the ability to “self heal”.

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.

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

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.