Polynomial identity testing (PIT) is the algorithmic task of determining whether a given polynomial is identically zero.

Abstract: Assume that we have to move a load of coal from source pile A to destination pile B, both of whose shape we know, and whose capacities are identical.

Abstract : The stochastic multi-armed bandit model is a simple abstraction that has been proven useful in many different contexts in statistics and machine learning. The problem is studied in a number of settings.

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

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