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

As scientists and engineers, we have long aimed at solving real-time problems such as detecting and localizing objects seen by our video recorder or at least something like Pokemon's Animedex.

Diophantine sets are defined using Diophantine equations. These sets are important and ubiquitous in number theory.