Abstract: We give an overview of zeros of random polynomials. Starting with results dating back to 1930s (Mark Kac, Offord etc), we intend to cover some of the many recent developments (due to various authors in the past ten years).

Abstract: In computational complexity theory, Håstad's switching lemma is a vital analytical tool for proving lower bounds on the size of constant-depth Boolean circuits.

Abstract: The talk begins with the clean-slate design problem of the Internet along with current service provider pain-points, focusing on plausible solutions, narrowing to the concept of Omnipresent Ethernet or OE.

Abstract: We consider the problem of selecting, from among n real-valued random variables, a subset of size m of those with the highest means, based on efficiently sampling the random variables.

Abstract: We propose a simple model of inter-bank borrowing and lending where the evolution of the log-monetary reserves of N banks is described by a system of diffusion processes coupled through their drifts in such a way that stability of the sy