Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SOFSEM
2010
Springer
11 years 11 months ago
Fast and Compact Prefix Codes
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...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich
SOFSEM
2010
Springer
11 years 11 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
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...
Parosh Aziz Abdulla
SOFSEM
2010
Springer
11 years 11 months ago
Approximate Structural Consistency
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 ...
Michel de Rougemont, Adrien Vieilleribière
SOFSEM
2010
Springer
12 years 8 months ago
Approximability of Edge Matching Puzzles
Antonios Antoniadis, Andrzej Lingas
SOFSEM
2010
Springer
12 years 8 months ago
On a Labeled Vehicle Routing Problem
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 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
SOFSEM
2010
Springer
12 years 8 months ago
Model-Driven Software Product Line Testing: An Integrated Approach
Andy Schürr, Sebastian Oster, Florian Markert
SOFSEM
2010
Springer
12 years 10 months ago
Finding and Certifying Loops
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...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
books