2597 search results - page 138 / 520 » On numbers of Davenport-Schinzel sequences |
DALT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Agent interaction protocols are usually specified in terms of permissible sequences of messages. This representation is, unfortunately, brittle and does not allow for ...
88
Voted
CSR
2007
Springer
15 years 5 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
92
Voted
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...
106
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
DM
2008
15 years 1 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...