Sciweavers

WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
13 years 10 months ago
Leader Election Problem versus Pattern Formation Problem
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...
Yoann Dieudonné, Franck Petit, Vincent Vill...
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
13 years 10 months ago
Distributed Contention Resolution in Wireless Networks
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 ...
Thomas Kesselheim, Berthold Vöcking
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 10 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
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,...
Johannes Schneider, Roger Wattenhofer
WDAG
2010
Springer
178views Algorithms» more  WDAG 2010»
13 years 10 months ago
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder...
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
13 years 10 months ago
The Computational Structure of Progress Conditions
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...
Gadi Taubenfeld
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
13 years 10 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
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...
Vijay K. Garg
WDAG
2010
Springer
199views Algorithms» more  WDAG 2010»
13 years 10 months ago
The 2010 Edsger W. Dijkstra Prize in Distributed Computing
Marcos Kawazoe Aguilera, Michel Raynal
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
13 years 10 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
13 years 10 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...