Distributed Computing

About this book

Distributed Computing: 15th International Conference, DISC 2001 Lisbon, Portugal, October 3–5, 2001 Proceedings Author: Jennifer Welch Published by Springer Berlin Heidelberg ISBN: 978-3-540-42605-9 DOI: 10.1007/3-540-45414-4 Table of Contents: A Time Complexity Bound for Adaptive Mutual Exclusion Quorum-Based Algorithms for Group Mutual Exclusion An Effective Characterization of Computability in Anonymous Networks Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System Optimal Unconditional Information Diffusion Computation Slicing: Techniques and Theory A Low-Latency Non-blocking Commit Service Stable Leader Election Adaptive Long-lived O(k A New Synchronous Lower Bound for Set Agreement The Complexity of Synchronous Iterative Do-All with Crashes Mobile Search for a Black Hole in an Anonymous Ring Randomised Mutual Search for k > 2 Agents Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks Self Stabilizing Distributed Queuing A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings Randomized Finite-state Distributed Algorithms As Markov Chains The Average Hop Count Measure For Virtual Path Layouts Efficient Routing in Networks with Long Range Contacts An Efficient Communication Strategy for Ad-hoc Mobile Networks