## Organisers:

## Time:

The field of researching Boolean functions can be summed up as

Boolean functions: *exist*

Researchers: find out EVERYTHING

Speaker:

Suhail Sherif, TIFR

Friday, 27 November 2020, 17:15 to 18:15

The field of researching Boolean functions can be summed up as

Boolean functions: *exist*

Researchers: find out EVERYTHING

Rohit Gupta

Tuesday, 24 November 2020, 14:00 to 15:00

Symmetry reduction is a well studied subject in geometric mechanics, where symmetries are usually described as an invariance under an action of a Lie group.

Speaker:

Anamay Tengse, TIFR

Monday, 23 November 2020, 11:15 to 12:15

We study the question of constructing _hitting sets_ for polynomials computed by several algebraic models.

Yash Khanna

Friday, 13 November 2020, 17:15 to 18:15

In this work, we design algorithms for two fundamentally important and classical graph problems in the planted setting.

Siddharth Barman

Tuesday, 10 November 2020, 16:00 to 17:00

The cake-cutting problem provides a model for addressing fair allocation of a divisible resource (metaphorically, the cake) among agents with distinct preferences.

Mohit Lamba

Friday, 6 November 2020, 17:15 to 18:15

As scientists and engineers, we have long aimed at solving real-time problems such as detecting and localizing objects seen by our video recorder or at least something like Pokemon's Animedex.

Gérard Berry

Tuesday, 3 November 2020, 16:00 to 17:00

The relation between math and algorithmics is very old. In a sense, one can even argue that mathematics was created to show that some already known algorithms worked in all cases and not only on some examples.

Eric Blais

Tuesday, 27 October 2020, 16:00 to 17:00

Randomness is a remarkably powerful tool in the design of algorithms. By giving algorithms the ability to use random bits and letting them err with some small probability, we can solve many computational problems with remarkable efficiency.

Speaker:

Sushant Vijayan, TIFR

Friday, 23 October 2020, 17:15 to 18:15

Algorithms for finding min-max equilibrium points in a zero sum game often exhibit cyclic behavior and non-convergence.

Ankit Garg

Tuesday, 20 October 2020, 16:00 to 17:00

The problem of learning arithmetic circuits is the following: given a polynomial as a black box that is promised to have a small arithmetic circuit computing it, can we find this arithmetic circuit?

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

Congrats Nikhil!

Dr. Prahladh Harsha has been awarded the prestigious Swarnajayanti Fellowship by DST, GOI for the year 2015-16.

Dr.Hariharan Narayanan joins the School of Technology and Computer Science as a Reader. Hariharan's research interests include manifold learning, randomized algorithms and convex geometry.

- ‹ previous
- 9 of 18
- next ›