IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
IPL
2010
13 years 10 months ago
2010
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
IPL
2010
13 years 10 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
IPL
2010
13 years 10 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
IPL
2010
13 years 10 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...