CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
CORR
2010
Springer
13 years 8 months ago
2010
Springer