8 search results - page 2 / 2 » Tight failure detection bounds on atomic object implementati... |
WDAG
1995
Springer
13 years 9 months ago
1995
Springer
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
CGF
1998
13 years 5 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...