Distributed Computing 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Welch, Jennifer L. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2180
• Θέματα: Computers.; Computer programming.; Special purpose computers.; Algorithms.; Operating systems (Computers).; Theory of Computation.; Programming Techniques.; Special Purpose and Application-Based Systems.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Operating Systems.

Πίνακας περιεχομένων:

• 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 2)-Renaming with O(k 2) Steps
• 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
• A Pragmatic Implementation of Non-blocking Linked-lists
• Stabilizing Replicated Search Trees
• Adding Networks.