WDAG
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
WDAG
2001
Springer
14 years 4 months ago
2001
Springer
WDAG
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
WDAG
2001
Springer
14 years 4 months ago
2001
Springer
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
WDAG
2001
Springer
14 years 4 months ago
2001
Springer
WADS
2001
Springer
14 years 4 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
WADS
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
WADS
2001
Springer
14 years 4 months ago
2001
Springer
WADS
2001
Springer
14 years 4 months ago
2001
Springer
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
WADS
2001
Springer
14 years 4 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...