## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Valiant (1979) showed that unless $P = NP$, there is no polynomial-time algorithm to compute the number of perfect matchings of a given graph --- even if the input graph is bipartite.

Nishad Kothari

Friday, 22 September 2017, 16:00 to 17:00

Valiant (1979) showed that unless $P = NP$, there is no polynomial-time algorithm to compute the number of perfect matchings of a given graph --- even if the input graph is bipartite.

Praneeth Netrapalli

Tuesday, 19 September 2017, 16:00 to 17:00

There is widespread sentiment that it is not possible to effectively utilize fast gradient methods (e.g.

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:

Kavitha Telikepalli, TIFR

Tuesday, 5 September 2017, 16:00 to 17:00

The stable marriage problem consists of a bipartite graph $G = (A \cup B,E)$ where every vertex has a ranking of its neighbours in a strict order of preference. Every stable matching matches the same subset of vertices.

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.

Arindam Khan

Thursday, 24 August 2017, 16:00 to 17:00

We study the two-dimensional geometric knapsack problem (2DK), a geometric variant of the classical knapsack problem.

Speaker:

Kshitij Gajjar, TIFR

Tuesday, 22 August 2017, 16:00 to 17:00

In this talk, we will be introducing the topic of distance-preserving subgraphs, and presenting some of our own results on distance-preserving subgraphs for interval graphs (joint work with Jaikumar).

Speaker:

Neha ., 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.

Rahul Jain

Monday, 14 August 2017, 16:00 to 17:00

Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory.

"Maximizing Utility Among Selfish Users in Social Groups"

Gugan Thoppe, a graduate student in the School of Technology and Computer Science, wins the IBM PhD Fellowship Award.

- ‹ previous
- 9 of 17
- next ›