In this talk we will give a proof of the fact that the two dimensional sphere can be partitioned into finitely many pieces in such a way that a rearrangement of the pieces produces two disjoint copies of the original sphere.

Zoom link:

An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle.  A clique of a graph $G$ is any maximal set of vertices that is complete in $G$.  Let $G$

This paper concerns designing  distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the  fundamental leader election problem in networks.

Motivated by the increasing adoption of models which facilitate greater automation in risk management and decision-making, this talk presents a novel Importance Sampling (IS) scheme for estimating distribution tails for a rich class of objectives

The field of researching Boolean functions can be summed up as

Boolean functions: *exist*
Researchers: find out EVERYTHING