## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

**Abstract: **I’m thinking of a person in the audience. How long will it take you to find whom, using only Yes/No questions?

Yuval Filmus

Tuesday, 29 January 2019, 14:30 to 15:30

**Abstract: **I’m thinking of a person in the audience. How long will it take you to find whom, using only Yes/No questions?

P.R. Kumar

Thursday, 7 June 2018, 11:00 to 12:00

Inspired by classical results in real-time scheduling, we consider a model of an access point serving several flows, and provide a possibly surprising characterization of what throughput vectors feasible, as well as throughput-optimal scheduling p

Ravi Kannan

Wednesday, 6 June 2018, 17:00 to 18:00

A small random sample of rows/columns of any matrix is a decent proxy for the matrix, provided sampling probabilities are proportional to squared lengths.

Gérard Huet

Thursday, 7 June 2018, 16:00 to 17:00

The talk will discuss the delicate balance between theory and practice in software design, in light of the author’s experience.

Soumen Chakrabarti

Tuesday, 24 April 2018, 14:30 to 15:30

Web search has come a long way from matching query words with document words. It is now mediated by knowledge graphs (KGs) such as Freebase, having hundreds of millions of entities belonging to tens of thousands of types, connected by billions of

Pankaj S. Joshi

Tuesday, 6 February 2018, 14:30 to 15:30

Gravitational collapse of matter clouds is a fundamental process in astrophysics, cosmology, and black hole physics today.

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$?