Abstract: An abstract set system, or hypergraph, consists of a universe (here assumed finite), together with a subset of its power set.

Abstract: In two-party secure computation, Alice has an input X, Bob has an input Y and both of them want to compute a function $f:\mathcal{X} \times \mathcal{Y} \to \mathcal{Z}$ securely by exchanging messages to each other over several rounds.

Abstract: A set S is said to be 3-term A.P free if there are no elements in S which form a 3-term A.P.In first part of talk, we will see a greedy way of constructing a 3-term A.P free set S.In the later part, we state and prove Behrend's theorem w

Abstract: In the first half of this talk, I will talk about the halting problem and show that there are well defined functions f:N->N that no computable function can dominate.

Abstract: We discuss a proof of the classical CLT (in Wasserstein metric) using Stein's Lemma.