WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...