We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhot...