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...
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...