13987 search results - page 565 / 2798 » The Two Guards Problem |
159
click to vote
WEWORC
2007
15 years 8 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
247
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
136
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider a dynamic server control problem for two parallel queues with randomly varying connectivity and server switchover time between the queues. At each time slot the server...
202
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
181
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The hairpin completion is a natural operation on formal languages which has been inspired by biochemistry and DNA-computing. In this paper we solve two problems which were posed f...