Abstract: In Secure multiparty computation (MPC), mutually distrustful parties each having a private input, perform a joint computation without revealing their inputs to each other.
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: This talk focuses on the design and analysis of scheduling policies for multi-class queues, such as those found in wireless networks and high-speed switches.
Abstract: Interior point methods or IPMs are a class of iterative algorithms in optimization that follow an interior path (unlike the simplex method which follows the boundary).
Abstract: Shannon's entropy power inequality characterizes the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies.
Abstract: Szemeredi's Regularity lemma is key result in extremal graph theory, that roughly states the following: For any $\epsilon>0$, the vertex set of a graph $G=(V,E)$ can be partitioned into $k=C(\epsilon)$ (i.e.
Abstract: Technological advances in sequencing, mapping, and analyzing genomes is proceeding at an extremely rapid pace, and the resulting explosion of genomics data is becoming difficult to manage.
