## Organisers:

## Time:

## Venue:

In this talk, we will discuss subcubic equivalence between the following problems:

Speaker:

Anamay Tengse, TIFR

Friday, 15 July 2016,

16:00 to 17:30

In this talk, we will discuss subcubic equivalence between the following problems:

Speaker:

Tulasi mohan Molli, TIFR

Friday, 8 July 2016,

16:00 to 17:30

In this talk we will see an efficient parallel algorithm for the Bipartite Perfect Matching problem (BPM) due to Fenner, Gurjar and Thierauf. The Perfect Matching problem (PM) is to decide whether a given graph has a perfect matching.

Speaker:

Sarat Babu Moka, TIFR

Friday, 24 June 2016,

16:00 to 17:30

Let X_1, X_2, ... ,X_n be, possibly dependent, [0,1]-valued random variables. The following question is important: What is a sharp upper bound on the probability that their sum is significantly larger (or significantly smaller) than their mean?

Speaker:

Paritosh K Pandya, TIFR

Thursday, 23 June 2016,

14:30 to 15:30

Musical sounds and their compositions can be analysed and synthesised using digital signal processing techniques. Computers are now increasingly used in editing, processing and even synthesis of music.

Pritam Bhattacharya

Friday, 17 June 2016,

16:00 to 17:30

The general Art Gallery Problem (AGP) consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon.

Ness B. Shroff

Friday, 10 June 2016,

16:00 to 17:00

We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every two days.

Speaker:

Rakesh Venkat, TIFR

Friday, 3 June 2016,

16:00 to 17:30

Given a matrix A which is n x m, the image of A (viewed as a linear operator) is the space spanned by its m columns {c_1, ..., c_m} .

Speaker:

Rahul Vaze, TIFR

Wednesday, 1 June 2016,

14:00 to 15:30

Consider a service utility where customers arrive over time, and the server is lazy and wants to serve customers with as little effort as possible.

Speaker:

Varun Narayanan, TIFR

Friday, 27 May 2016,

16:00 to 17:30

A randomized algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space was proposed by Martin Dyer, Alan Frieze and Ravi Kannan in 1988.

Speaker:

Ashutosh Gupta, TIFR

Thursday, 26 May 2016,

11:00 to 12:30

Computer science (CS) has emerged in last 40+ years to be a branch of science on its own. The concerns in CS involve all the way from fundamentals of mathematics to designing usable social networking apps.

Dr. Ashutosh Gupta's paper "Model Checking Gene Regulatory Networks,

TACAS 2015" co-authored with M. Giacobbe, C. Guet, T. Henzinger, T.

Dr. Simoni Shah was awarded the Sasken Best Thesis Award for the year 2013-14 for her Ph.D.

- ‹ previous
- 2 of 12
- next ›