WDAG 2007 - PDF Preprint Papers

WDAG 2007 International Workshop on Distributed Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WDAG-2007 Paper

click to vote

WDAG
2007
Springer

162views Algorithms» more WDAG 2007»

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

14 years 6 months ago

Download www.ti.inf.ethz.ch

Communication in networks suﬀers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...

Beat Gfeller, Nicola Santoro, Peter Widmayer

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	162	A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree	claim
2	132	Detecting Temporal Logic Predicates on Distributed Computations	claim
3	128	From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors	claim
4	127	A Distributed Maximal Scheduler for Strong Fairness	claim
5	125	Approximating Wardrop Equilibria with Finitely Many Agents	claim
6	105	Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links	claim
7	103	Probabilistic Opaque Quorum Systems	claim
8	102	A Denial-of-Service Resistant DHT	claim
9	100	Scalable Load-Distance Balancing	claim
10	100	Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions	claim
11	97	On the Message Complexity of Indulgent Consensus	claim
12	92	Self-stabilizing Counting in Mobile Sensor Networks with a Base Station	claim
13	90	Gossiping in a Multi-channel Radio Network	claim
14	88	Automatic Classification of Eventual Failure Detectors	claim
15	86	Cost-Aware Caching Algorithms for Distributed Storage Servers	claim
16	86	Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time	claim
17	86	Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks	claim
18	85	Fully Distributed Algorithms for Convex Optimization Problems	claim
19	84	Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks	claim
20	82	The Space Complexity of Unbounded Timestamps	claim
21	79	A Simple Population Protocol for Fast Robust Approximate Majority	claim
22	76	Transaction Safe Nonblocking Data Structures	claim
23	73	On Self-stabilizing Synchronous Actions Despite Byzantine Attacks	claim
24	68	Push-to-Pull Peer-to-Peer Live Streaming	claim
25	63	A Formal Analysis of the Deferred Update Technique	claim
26	59	Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers