Abstract: We consider three different parameters measuring (non-)convexity of subsets of the plane or, more generally, of an Euclidean space. In particular, we are interested in mutual relations of these parameters.
Abstract: In recent years, an online adaptation of the classical primal-dual paradigm has been successfully used to obtain new online algorithms for node-weighted network design problems, and simplify existing ones fo
Abstract: We ask the following question: given a network with a large number of nodes, edges with nonnegative costs on them and a small set of special nodes called terminals, by how much can we compress the graph such that the shortest dis
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).
