SOFSEM
2010
Springer
13 years 9 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
SOFSEM
2010
Springer
13 years 9 months ago
2010
Springer
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
SOFSEM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
