## Organisers:

## Time:

## Venue:

In this talk I'll be presenting the result of Beigi et.al.

Speaker:

Aditya Nema, TIFR

Friday, 2 February 2018, 17:15 to 18:45

In this talk I'll be presenting the result of Beigi et.al.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 19 January 2018, 17:15 to 18:45

A congestion game is a game where the cost of a player for using a resource depends on all the players using that resource.

Speaker:

Kshitij Gajjar, TIFR

Friday, 5 January 2018, 17:15 to 18:45

Let $G$ be a directed graph on $n$ vertices (with two designated vertices $s$ and $t$) such that the edge weights of $G$ are real-valued linear functions of a parameter $\lambda$.

Speaker:

Palash Dey, TIFR

Friday, 29 December 2017, 17:15 to 18:15

We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different notions of outcomes of such elections.

Bharadwaj Satchidanandan

Friday, 22 December 2017, 15:00 to 16:00

This talk addresses in the main the problem of secure control of networked cyber-physical systems, and, title notwithstanding, a digression into mm-wave networks that have quickly become of great topical interest since the FCC release of 10.85 GHz

Speaker:

Sayantan Chakraborty, TIFR

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

Entanglement is an important resource in quantum communication protocols and as such the problem of turning a preshared entangled state between two parties Alice and Bob into a Bell state has been studied extensively.

Speaker:

Marc Vinyals, TIFR

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

Propositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic.

Speaker:

Varun Narayanan, TIFR

Friday, 10 November 2017, 17:15 to 18:15

We would discuss the lower bound on the joint entropy of pairwise independent random variables (X_1, ... , X_n) by Lazlo Babai (2013).

Speaker:

Sumedh Vinod Tirodkar, TIFR

Friday, 27 October 2017, 17:15 to 18:15

We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum et al.

Vidya Sagar Sharma

Friday, 20 October 2017, 17:15 to 18:15

Storing sets is a common problem in Computer Science.