This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Blending attacks are a general class of traffic-based attacks, exemplified by the (n − 1)-attack. Adding memory or pools to mixes mitigates against such attacks, however there ...
Physical browsing is a mobile-device-based interaction method for pervasive computing. In this paper, we describe our research interests and experiences of physical browsing: the ...