## Speaker:

## Time:

This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks.

William K. Moses Jr.

Saturday, 9 January 2021, 10:00 to 11:00

This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks.

Speaker:

Anamay Tengse, TIFR

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

In the late 1990s, a paper by Razborov and Rudich pointed out a barrier towards proving boolean circuit lower bounds.

Speaker:

Anand Deo, TIFR

Friday, 18 December 2020, 17:15 to 18:15

Motivated by the increasing adoption of models which facilitate greater automation in risk management and decision-making, this talk presents a novel Importance Sampling (IS) scheme for estimating distribution tails for a rich class of objectives

Speaker:

Abhishek Singh, TIFR

Monday, 14 December 2020, 10:30 to 11:30

Mathematical proofs when written in conventional ways often contain imprecise definitions, unstated background assumptions, and inferential gaps in reasoning.

Speaker:

Anirban Bhattacharjee, TIFR

Friday, 11 December 2020, 17:15 to 18:15

In Reinforcement Learning, one often needs to evaluate a given policy using rewards observed by following another policy. This is called off-policy evaluation in Learning Theory parlance.

Jatin Batra

Thursday, 10 December 2020, 16:00 to 17:00

Scheduling provides an interesting context for optimization methods.

Prof. Dakshita Khurana

Tuesday, 8 December 2020, 17:30 to 18:30

We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption.

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.

Dr. Shibashis Guha joins the School of Technology and Computer Science as a Reader. Shibashis's research interests include areas of formal methods together with algorithmic game theory, timed automata and Markov decision processes.

Applications are invited for two research fellows to work on the following project in the School of Technology and Computer Science at TIFR, Mumbai.

Mathematical modelling and simulation of epidemic spread in India and in the rest of the world.

- ‹ previous
- 3 of 24
- next ›