## Organisers:

## Time:

Games are used to model many instances arising from interaction of more than one computational agent. In program synthesis, existence of strategy is the key in deciding the existence of a program with a given set of specifications.

Speaker:

Prabhat Kumar Jha, TIFR

Friday, 26 February 2021, 15:00 to 16:00

Games are used to model many instances arising from interaction of more than one computational agent. In program synthesis, existence of strategy is the key in deciding the existence of a program with a given set of specifications.

Abhishek Khetan

Friday, 19 February 2021, 17:15 to 18:15

In this talk we will give a proof of the fact that the two dimensional sphere can be partitioned into finitely many pieces in such a way that a rearrangement of the pieces produces two disjoint copies of the original sphere.

Zoom link:

Speaker:

Siddharth Bhandari, TIFR

Friday, 12 February 2021, 17:15 to 18:15

We will study the Decision-Tree complexity of element distinctness using arbitrary binary gates (an instance of which is comparison gates). Concretely, let $m$ and $n$ be natural numbers with $m>n$.

Speaker:

Vidya Sagar Sharma, TIFR

Saturday, 30 January 2021, 17:15 to 18:15

An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle. A clique of a graph $G$ is any maximal set of vertices that is complete in $G$. Let $G$

Neeraj Kayal

Tuesday, 26 January 2021, 16:00 to 17:00

In this talk, we will consider algorithmic problems which follow the following template: given a real-valued multivariate polynomial f(x) of degree d, is it approximately equal to a sum of a few "simple" polynomials, i

Speaker:

Varun Narayanan, TIFR

Monday, 18 January 2021, 11:00 to 12:00

Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography.

Kshitij Gajjar

Friday, 15 January 2021, 17:15 to 18:15

Many graph problems that are NP-hard for general graphs can be solved in polynomial time for planar graphs. We explore the domain of "almost" planar graphs. These are graphs that can be made planar by removing one or two vertices from them.

The paper, "Network Speed Scaling" co-authored by Dr. Rahul Vaze, received the best paper award at IFIP Performance 2020.

Neha Sangwan, graduate student in the School of Technology and Computer Science, has been awarded the TCS Research Scholarship.

Congrats Neha!

- ‹ previous
- 2 of 24
- next ›