Abstract: The probabilistic degree of a Boolean function f is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability.

Abstract: In distributed IoT paradigm, we often have cases where multiple nodes need to keep a common server updated with their status information.

Abstract: The year was 1953. Rajendra Prasad was still the president of India after winning the presidential election one year prior.

Abstract: In this talk, we will explore a surprising connection between graph theory and convex geometry. We look at graphs whose edge weights are linear forms in $d$ variables.

Abstract: A polynomial is said to be multilinear if the individual degree of every variable is at most one in any monomial; and is said to be homogeneous if every monomial in it has the same degree.