## Speaker:

## Organisers:

## Time:

## Venue:

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

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.

Rakesh Venkat

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

Jakob Nordstrom

Tuesday, 21 February 2017, 16:00 to 17:00

We study the problem of certifying unsatisfiability of formulas in propositional logic.

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.

Marc Vinyals

Tuesday, 14 February 2017, 16:00 to 17:00

Nowadays SAT solvers are able to solve problems with millions of variables, but some instances are still hard. While some formulas just require large time or memory to solve, other formulas allow to trade these resources.

Speaker:

Siddharth Bhandari, TIFR

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

I will present a technique know as fast subset convolution for Exact Exponential Algorithms.

Speaker:

Rahul Vaze, TIFR

Tuesday, 7 February 2017, 16:00 to 17:00

In a breakthrough, we are able to give a simple description of 'capacity' of cellular wireless networks. Shannon capacity is intractable for most wireless networks, and a surrogate definition is used.

Sayan Bhattacharya

Tuesday, 31 January 2017, 16:00 to 17:00

We consider the problem of maintaining a matching and a vertex cover of approximately maximum (resp. minimum) size in a dynamic graph under a sequence of edge insertions and deletions.

Speaker:

Piyush Srivastava, TIFR

Friday, 27 January 2017, 16:00 to 17:30

Consider a system consisting of a binary "stimulus" variable X, (e.g. whether an individual consumes tobacco), a binary "response" variable Y, (e.g.

Venkatesan Guruswami

Wednesday, 25 January 2017, 17:00 to 19:00

A subspace design is a (large) collection of subspaces of F_q^n, each of small co-dimension, such that for any low-dimensional subspace W, only a small number from the collection have a non-trivial intersection with W.

Ankush Agarwal, a graduate student in the School of Technology and Computer Science wins the TCS Research Scholarship, instituted by Tata Consulatancy Services (TCS).

Dr. Arkadev Chattopadhyay joins the School of Technology and Computer Science as a Reader.

- ‹ previous
- 12 of 15
- next ›