Share on TelegramDistributed computing : 15th international conference, DISC 2001, Lisbon, Portugal, October 3 5, 2001 : procee
User Rating: Be the first one!
Author: DISC 2001 (2001 : Lisbon, Portugal), Welch, Jennifer
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Electronic data processing
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540426051
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 175.06 MB
PDF Size: 4.1 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 431
Views: 481
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 45414 4 archive t...torrent
Last Modified: 2022-03-09 08:44:37
Download
Size: 10.95 KB
Description
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:
Includes bibliographical references and index
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
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts
