## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Poisson processes are frequently used, e.g. to model the customer arrival process in service systems, or the claim arrival proces in insurance models.

Michel Mandjes

Tuesday, 23 January 2018, 14:30 to 15:30

Poisson processes are frequently used, e.g. to model the customer arrival process in service systems, or the claim arrival proces in insurance models.

Srikanth Srinivasan

Tuesday, 5 December 2017, 16:00 to 17:00

We study the size blow-up that is necessary to convert an algebraic circuit of constant product-depth D+1 to one of product-depth D in the multilinear setting.

Nutan Limaye

Tuesday, 28 November 2017, 16:00 to 17:00

The complexity of Iterated Matrix Multiplication is a central theme in Computational Complexity theory, as the problem is closely related to the problem of separating various complexity classes within $P$.

Apoorva Khare

Tuesday, 17 October 2017, 16:00 to 17:00

Given a graph $G$, let $\mathbb{P}_G$ denote the cone of positive semidefinite (psd) matrices, with non-negative entries, and zeros according to $G$. Which powers preserve psd-ness when applied entrywise to all matrices in $\mathbb{P}_G$?

Shweta Agrawal

Monday, 23 October 2017, 14:30 to 15:30

Garbled circuits are a central primitive in cryptography. Intuitively, a garbled circuit enables its holder to evaluate a circuit on an input, so that the evaluator learns the output but learns nothing about the circuit or the input.

Mukund Thattai

Tuesday, 10 October 2017, 14:30 to 15:30

We study the logistics system of eukaryotic cells, whose warehouses are micron-scale "organelles" and whose trucks are 10-nanometer-scale "vesicles". Organelles form the nodes and vesicle fluxes form the edges of a transport graph.

Praneeth Netrapalli

Tuesday, 19 September 2017, 16:00 to 17:00

There is widespread sentiment that it is not possible to effectively utilize fast gradient methods (e.g.

Chiranjib Mukherjee

Tuesday, 3 October 2017, 16:00 to 17:00

In a reasonable topological space, large deviation estimates essentially deal with probabilities of events that are asymptotically (exponentially) small, and in a certain sense, quantify the rate of these decaying probabilities.

Speaker:

Kavitha Telikepalli, TIFR

Tuesday, 5 September 2017, 16:00 to 17:00

The stable marriage problem consists of a bipartite graph $G = (A \cup B,E)$ where every vertex has a ranking of its neighbours in a strict order of preference. Every stable matching matches the same subset of vertices.

Ravi Mazumdar

Tuesday, 2 May 2017, 16:00 to 17:00

In many applications such as cloud computing, managing server farm resources etc. an incoming task or job has to be matched with an appropriate server in order to minimise the latency or blocking associated with the processing.