We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...