## Organisers:

## Time:

## Venue:

A boolean circuit is a natural model of computation for Boolean functions. Size and Depth of a circuit are two measures of complexity of the circuit.

Speaker:

Tulasi mohan Molli, TIFR

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

A boolean circuit is a natural model of computation for Boolean functions. Size and Depth of a circuit are two measures of complexity of the circuit.

Speaker:

Gunjan Kumar, TIFR

Friday, 8 September 2017, 17:15 to 18:15

We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 1 September 2017, 17:15 to 18:15

Suppose we want to transmit messages across a noisy channel to a receiver. The maximum rate of transmission such that the receiver may recover the original message without errors (i.e., zero error) is called zero error capacity of the channel.

Speaker:

Neha Sangwan, TIFR

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

In this talk, we will study the PhD-work of Risi Kondor in which he demonstrates how bispectrum invariants can be used to classify translated and rotated images.

Speaker:

Siddharth Bhandari, TIFR

Friday, 11 August 2017, 17:15 to 18:15

A recent powerful method has been independently developed by Saxton and Thomason (2012) and by Balogh, Morris, Samotij (2014).

Speaker:

Suhail Sherif, TIFR

Friday, 28 July 2017, 17:15 to 18:15

We look at the boolean function in which the input is a boolean matrix with the promise that either 2/3rd of its rows contain a 1 or 2/3rd of its rows do not contain a 1.

Speaker:

Anand Deo, TIFR

Friday, 21 July 2017, 17:15 to 18:15

Discrete default intensity based or logit type models are commonly used as reduced form models for conditional default probabilities for corporate loans where this default probability depends upon macroeconomic as well as firm-specific covariates.

Speaker:

Varun Narayanan, TIFR

Friday, 30 June 2017, 17:15 to 18:15

We discuss the notion of security in the multi-party computing protocols. We start with the simpler definition of standalone security.

Speaker:

Anamay Tengse, TIFR

Friday, 23 June 2017, 17:15 to 18:15

Nisan gave an exact characterization of the ``non-commutative algebraic branching program (ABP) complexity'' of a polynomial in 1991.

Santhoshini Velusamy

Friday, 16 June 2017, 17:15 to 18:15

This paper is joint work with Venkatesan Guruswami and Ameya Vellingker, to appear in APPROX 17.