Distributed computing : 15th International Conference, DISC 2001 Lisbon, Portugal, October 3 5, 2001 : proceedings
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
2180 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Distributed computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, proceedings, Jennifer Welch (ed.), New York, Springer, 2001, 1 vol. (X-341 p.), Lecture notes in computer science, 3-540-42605-1 • Distributed Computing, Texte imprimé, 9783662162965 |
Inhoudsopgave:
- 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.