## Organisers:

## Time:

## Venue:

A probabilistic polynomial is like a randomized algorithm. It is a distribution on polynomials such that, for each input, the probabilistic polynomial computes the function exactly with high probability.

Speaker:

Tulasi mohan Molli, TIFR

Wednesday, 29 August 2018, 17:15 to 18:15

A probabilistic polynomial is like a randomized algorithm. It is a distribution on polynomials such that, for each input, the probabilistic polynomial computes the function exactly with high probability.

Shivaram Kalyanakrishnan

Tuesday, 28 August 2018, 14:00 to 15:00

**Abstract: **Markov Decision Problems (MDPs) are a well-studied abstraction of sequential decision making. Policy Iteration (PI) is a classical, widely-used family of algorithms to compute an optimal policy for a given MDP.

Vishwas Bhargava

Friday, 24 August 2018, 17:15 to 18:15

In this talk, we describe a new type of probabilistic algorithm (introduced by Gat and Goldwasser [GG11]) called Pseudo-deterministic Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time and to produce a correc

Prof. Mustansir Barma

Friday, 17 August 2018, 16:00 to 17:00

The element of chance enters not only in our daily affairs, but also in practically every branch of science. This lecture will discuss both aspects.

Prabhat Jha

Friday, 10 August 2018, 17:15 to 18:15

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

Speaker:

Siddharth Bhandari, TIFR

Friday, 27 July 2018, 17:15 to 18:15

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.

Andrew Heunis

Tuesday, 24 July 2018, 16:00 to 17:00

We address a problem of stochastic optimal control motivated by portfolio optimization in mathematical finance, the goal of which is to minimize the expected value of a general quadratic loss function of the wealth at close of trade when there is

Speaker:

Nikhil S Mande, TIFR

Friday, 20 July 2018, 17:15 to 18:15

Abstract:

We consider functions computable efficiently by "linear decision lists", which are decision lists where the queries are linear threshold functions.

Kunal Dutta

Friday, 20 July 2018, 14:00 to 15:00

**Abstract:** In this talk we shall see three very different areas of applications of combinatorics in mathematics and computer science, illustrating different flavours of combinatorial reasoning.

Madhu Sudan

Wednesday, 11 July 2018, 14:00 to 15:00

I will describe a recent approach to designing codes that correct for "editing" errors - i.e., where an adversary is allowed to delete some of the symbols in a string being transmitted and insert new symbols. The classical Hamming model of errors

Anand Deo, a graduate student at the School of Technology and Computer

Science has won the best paper award at the CRISIL Doctoral Symposium 2017,

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

- ‹ previous
- 2 of 17
- next ›