## Organisers:

## Time:

## Venue:

**Abstract: **We will discuss Braverman and Rao's result that shows that the internal communication cost is same as the amortized communication complexity.

Speaker:

Varun Narayanan, TIFR

Tuesday, 12 February 2019, 16:00 to 17:00

**Abstract: **We will discuss Braverman and Rao's result that shows that the internal communication cost is same as the amortized communication complexity.

Speaker:

Siddharth Bhandari, TIFR

Friday, 1 February 2019, 17:15 to 18:15

**Abstract: **For a set $S$ of $n$ points in the unit square $U$, let $T(S)$ be the minimum area of a triangle whose vertices are three distinct points of $S$. Let $T(n)=max T(S)$ where $S$ ranges over all set of $n$ points in U.

Yuval Filmus

Tuesday, 29 January 2019, 14:30 to 15:30

**Abstract: **I’m thinking of a person in the audience. How long will it take you to find whom, using only Yes/No questions?

Speaker:

Kshitij Gajjar, TIFR

Friday, 25 January 2019, 17:15 to 18:15

**Abstract:** In this talk, we will see a close connection between alternation-free sequences of words over the alphabet $\mathbb{Z}_n$ and parametric shortest paths in certain graphs.

Pranabendu Mirsa

Thursday, 10 January 2019, 14:30 to 15:30

**Abstract: ** Network Design Problems, which concern designing minimum cost networks that satisfy given set of ``connectivity constrains'', are very well studied in computer science and combinatorial optimization.

Parikshit Gopalan

Monday, 7 January 2019, 14:00 to 15:00

**Abstract:** We consider the problem of interactively visualizing a distributed tabular dataset with billions of rows.

Mrinal Kumar

Monday, 7 January 2019, 11:00 to 12:00

**Abstract : **In a sequence of seminal results in the 80's, Kaltofen showed that if an n-variate polynomial of degree poly(n) can be computed by an arithmetic circuit of size poly(n), then each of its factors can also be computed an

Speaker:

Kshitij Gajjar, TIFR

Friday, 4 January 2019, 17:15 to 18:15

**Abstract: **Computing and maintaining shortest paths is a fundamental problem in computer science.

Varun Jog

Wednesday, 2 January 2019, 16:00 to 17:00

**Abstract: ** In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data.

Palash Dey, a visiting fellow at the School of Technology and Computer Science, has been awarded the ACM India Doctoral Dissertation Award for 2017, for his thesis entitled "Resolving the Complexit

Nikhil Mande, graduate student in the School of Technology and Computer Science, win the TCS Research Scholarship.

Congrats Nikhil!

- ‹ previous
- 3 of 17
- next ›