WDAG
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
WADS
1997
Springer
14 years 3 months ago
1997
Springer
WADS
1997
Springer
14 years 3 months ago
1997
Springer
WADS
1997
Springer
14 years 3 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
WADS
1997
Springer
14 years 3 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
WADS
1997
Springer
14 years 3 months ago
1997
Springer
WADS
1997
Springer
14 years 3 months ago
1997
Springer
WADS
1997
Springer
14 years 3 months ago
1997
Springer
WADS
1997
Springer
14 years 3 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
WADS
1997
Springer
14 years 3 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...