Distributed Computing
Subtitle: 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: October 25, 2001
Language: eng
Format: Paperback
Number of pages: 343
ISBN-13: 9783540426059
Subjects: Algorithms & procedures; Applications of Computing; General Theory of Computing; Distributed Computer Systems; Computers; Computers - General Information; Programming - Systems Analysis & Design; Computer Books: General; General; Distributed processing; Client-Server Computing - General; Data Processing - General; Complexity; Computers / Programming / Systems Analysis & Design; Concurrent Programming; Distributed Algorithms; Distributed Computing; Distributed Systems; Information Diffusion; Congresses; Electronic data processing
First sentence: In this paper, we consider the time complexity of adaptive mutual exclusion algorithms.
Description: Distributed Computing: 15th International Conference, DISC 2001 Lisbon, Portugal, October 3–5, 2001 Proceedings<br />Author: Jennifer Welch<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42605-9<br /> DOI: 10.1007/3-540-45414-4<br /><br />Table of Contents:<p></p><ul><li>A Time Complexity Bound for Adaptive Mutual Exclusion
</li><li>Quorum-Based Algorithms for Group Mutual Exclusion
</li><li>An Effective Characterization of Computability in Anonymous Networks
</li><li>Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
</li><li>Optimal Unconditional Information Diffusion
</li><li>Computation Slicing: Techniques and Theory
</li><li>A Low-Latency Non-blocking Commit Service
</li><li>Stable Leader Election
</li><li>Adaptive Long-lived O(k
</li><li>A New Synchronous Lower Bound for Set Agreement
</li><li>The Complexity of Synchronous Iterative Do-All with Crashes
</li><li>Mobile Search for a Black Hole in an Anonymous Ring
</li><li>Randomised Mutual Search for k > 2 Agents
</li><li>Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
</li><li>Self Stabilizing Distributed Queuing
</li><li>A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
</li><li>Randomized Finite-state Distributed Algorithms As Markov Chains
</li><li>The Average Hop Count Measure For Virtual Path Layouts
</li><li>Efficient Routing in Networks with Long Range Contacts
</li><li>An Efficient Communication Strategy for Ad-hoc Mobile Networks</li></ul>