## Organisers:

## Time:

## Venue:

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

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.

Venkatesan Guruswami

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

Error-correcting codes play a crucial role in safeguarding data against the adverse effects of noise during communication and storage. They are also powerful tools that underlie several advances in theoretical computer science.

Speaker:

Kshitij Gajjar, TIFR

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

An n × n Latin square is a grid with n rows and n columns such that each cell of the grid is filled with one number from the set {1,2,...n} and no number is repeated in any row or any column.

Abhishek Sinha

Friday, 20 January 2017, 11:30 to 13:00

One of the fundamental problems in Computer Networking is to efficiently transport packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows.

Speaker:

Abhishek Singh, TIFR

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

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Kuldeep S. Meel

Wednesday, 11 January 2017, 11:00 to 12:30

Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, decision making under certainty, probabilistic reasoning, and constrained-random verification.

Dr. Vinod M. Prabhakaran joins the faculty of the School of Technology and Computer Science as a Reader.

Dr. Rahul Vaze, Fellow STCS, and Prof. Robert W. Health Jr. (University of Texas at Austin) win the 2011 EURASIP 2011 best paper award.

- ‹ previous
- 14 of 15
- next ›