Sciweavers

IPL
2010
61views more  IPL 2010»
13 years 3 months ago
Optimizing the Region Algebra is PSPACE-complete
Wouter Gelade, Frank Neven
IPL
2010
69views more  IPL 2010»
13 years 3 months ago
Enumeration of balanced symmetric functions over GF(p)
Shaojing Fu, Chao Li, Kanta Matsuura, Longjiang Qu
IPL
2010
79views more  IPL 2010»
13 years 3 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
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 ...
Christophe Crespelle, Philippe Gambette
IPL
2010
69views more  IPL 2010»
13 years 3 months ago
On the additive constant of the k-server Work Function Algorithm
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...
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Ro...
IPL
2010
80views more  IPL 2010»
13 years 3 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
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...
Ranko Lazic
IPL
2010
107views more  IPL 2010»
13 years 3 months ago
Collisions for variants of the BLAKE hash function
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...
Janos Vidali, Peter Nose, Enes Pasalic
IPL
2010
111views more  IPL 2010»
13 years 3 months ago
Connecting face hitting sets in planar graphs
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...
Pascal Schweitzer, Patrick Schweitzer
IPL
2010
94views more  IPL 2010»
13 years 3 months ago
A compact data structure for representing a dynamic multiset
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...
Jyrki Katajainen, S. Srinivasa Rao