## Organisers:

## Time:

## Venue:

A threshold function on n bits is a function that can be represented as the sign of a linear function of its inputs, i.e. f(x) = sign(w_1 x_1 + ... w_n x_n + c)

Speaker:

Suhail Sherif, TIFR

Friday, 13 April 2018, 16:00 to 17:00

A threshold function on n bits is a function that can be represented as the sign of a linear function of its inputs, i.e. f(x) = sign(w_1 x_1 + ... w_n x_n + c)

Speaker:

Prerona Chatterjee, TIFR

Friday, 6 April 2018, 17:15 to 18:15

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 16 March 2018, 17:15 to 18:45

We discuss a technique that provides a sufficient condition for establishing a Markov chain on the joint distribution.

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.