Abstract: An Algebraic Branching Program (ABP) is a layered graph where each edge is labeled by an affine linear form and the first and the last layer have one vertex each, called the “start” and the “end” vertex respectively.

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.