Burkhard Monien, Karsten Tiemann (auth.), Andrzej Pelc (eds.)3540751416, 9783540751410
Table of contents :
Front Matter….Pages –
Routing and Scheduling with Incomplete Information….Pages 1-2
Time-Efficient Broadcasting in Radio Networks….Pages 3-4
A Subjective Visit to Selected Topics in Distributed Computing….Pages 5-6
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions….Pages 7-19
A Simple Population Protocol for Fast Robust Approximate Majority….Pages 20-32
A Denial-of-Service Resistant DHT….Pages 33-47
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks….Pages 48-62
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station….Pages 63-76
Scalable Load-Distance Balancing….Pages 77-91
Time Optimal Asynchronous Self-stabilizing Spanning Tree….Pages 92-107
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links….Pages 108-122
Weakening Failure Detectors for k -Set Agreement Via the Partition Approach….Pages 123-138
Amnesic Distributed Storage….Pages 139-151
Distributed Approximations for Packing in Unit-Disk Graphs….Pages 152-164
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors….Pages 165-178
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time….Pages 179-192
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks….Pages 193-207
Gossiping in a Multi-channel Radio Network….Pages 208-222
The Space Complexity of Unbounded Timestamps….Pages 223-237
Approximating Wardrop Equilibria with Finitely Many Agents….Pages 238-252
Energy and Time Efficient Broadcasting in Known Topology Radio Networks….Pages 253-267
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree….Pages 268-282
On the Message Complexity of Indulgent Consensus….Pages 283-297
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result….Pages 298-312
Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes….Pages 313-327
On the Communication Surplus Incurred by Faulty Processors….Pages 328-342
Output Stability Versus Time Till Output….Pages 343-357
A Distributed Maximal Scheduler for Strong Fairness….Pages 358-372
Cost-Aware Caching Algorithms for Distributed Storage Servers….Pages 373-387
Push-to-Pull Peer-to-Peer Live Streaming….Pages 388-402
Probabilistic Opaque Quorum Systems….Pages 403-419
Detecting Temporal Logic Predicates on Distributed Computations….Pages 420-434
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks….Pages 435-449
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms….Pages 450-464
Automatic Classification of Eventual Failure Detectors….Pages 465-479
When 3 f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus….Pages 480-481
On the Complexity of Distributed Greedy Coloring….Pages 482-484
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks….Pages 485-487
Transaction Safe Nonblocking Data Structures….Pages 488-489
Long Live Continuous Consensus….Pages 490-491
Fully Distributed Algorithms for Convex Optimization Problems….Pages 492-493
On the Power of Impersonation Attacks….Pages 494-495
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary….Pages 496-498
A Formal Analysis of the Deferred Update Technique….Pages 499-500
DISC at Its 20th Anniversary (Stockholm, 2006)….Pages 501-503
DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems….Pages 504-504
DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982….Pages 505-505
DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems….Pages 506-508
Back Matter….Pages –
Reviews
There are no reviews yet.