## Organisers:

## Time:

## Venue:

Suppose $A$ and $B$ are parties in a network and want to communicate with each other privately. This problem is trivial if $A$ and $B$ have a private communication link between them. What if there is no such link?

Speaker:

Varun Narayanan, TIFR

Friday, 7 April 2017, 17:15 to 18:15

Suppose $A$ and $B$ are parties in a network and want to communicate with each other privately. This problem is trivial if $A$ and $B$ have a private communication link between them. What if there is no such link?

Venkat Anantharam

Thursday, 30 March 2017, 16:00 to 17:00

Many modern data sources arising from social networks, biological data, etc. are best viewed as indexed by combinatorial structures such as graphs, rather than as time series.

K. Gajjar, S. Bhandari

Friday, 24 March 2017, 17:15 to 18:15

The Liars Game is a turn-based two-player game (lets call the two players Alice and Bob). The game is specified by two positive integers $k$ and $n$ which are known to both Alice and Bob.

Speaker:

Aditya Nema, TIFR

Friday, 17 March 2017, 17:15 to 18:15

In this talk, we will discuss De Finetti representation theorem on exchangeable probability assignment, that provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken

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.

Abhinav Ganesan

Friday, 3 March 2017, 15:30 to 16:30

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Surender Baswana

Thursday, 16 March 2017, 14:00 to 15:00

Consider the following problem of single source reachability under failures of vertices or edges. Let $G$ be a given directed graph on n vertices with a designated source vertex $s$, and $k$ be any positive integer. Compute the sparsest subgraph

Rakesh Venkat

Friday, 24 February 2017, 16:00 to 17:30

A two-player game is an important construct used in proving many hardness of approximation results.

Speaker:

Sayantan Chakraborty, TIFR

Friday, 17 February 2017, 16:00 to 17:30

The usual idea of compactness of a space is that if the space has an open cover then it has a finite subcover which is not very intuitive. In this talk we attempt to look at some equivalent characterisations of compact spaces.

Rakesh Venkat

Thursday, 23 February 2017, 14:30 to 15:30