IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
IPL
2010
13 years 10 months ago
2010
We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. A...
IPL
2010
13 years 10 months ago
2010
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
IPL
2010
13 years 10 months ago
2010
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...
IPL
2010
13 years 10 months ago
2010
IPL
2010
13 years 10 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
IPL
2010
13 years 10 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
IPL
2010
13 years 10 months ago
2010
