Abstract:   For a class of polynomials P,  a set of evaluation points H is said to be a hitting set if any nonzero polynomial P is nonzero on some point in H.

Abstract: In this talk we shall see a strategy to achieve the best rate possible for the point-to-point channel with eavesdropper (while maintaining secrecy),  in the one-shot regime.

Abstract: For a set $S$ of $n$ points in the unit square $U$, let $T(S)$ be the minimum area of a triangle whose vertices are three distinct points of $S$. Let $T(n)=max T(S)$ where $S$ ranges over all set of $n$ points in U.

Abstract: Randomness can provide an exponential saving in the amount of communication needed to solve a distributed problem, and the canonical example of this is equality.

Abstract: A polynomial $f(x_1,\ldots,x_n)$ is said to be an identity for $m \times m$ matrices if $f(M_1,\ldots,M_n) = 0$ for all choices of $m \times m$ matrices for $M_i$s.