Sciweavers

184
Voted
ICDCN
2009
Springer
16 years 11 days ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
ICDCN
2009
Springer
16 years 11 days ago
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The constructio...
Colette Johnen, Lisa Higham
100
Voted
ICDCN
2009
Springer
16 years 11 days ago
Finding Facilities Fast
Saurav Pandit, Sriram V. Pemmaraju
ICDCN
2009
Springer
16 years 11 days ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman
ICDCN
2009
Springer
16 years 11 days ago
Snap-Stabilization in Message-Passing Systems
Sylvie Delaët, Stéphane Devismes, Mikh...
ICDCN
2009
Springer
16 years 11 days ago
Self-similar Functions and Population Protocols: A Characterization and a Comparison
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
Swapnil Bhatia, Radim Bartos