Distributed computing : 18th international conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004 : proceedings
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
3274 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, 18th international conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, proceedings, Rachid Guerraoui (Ed.), Berlin, Springer, 2004, 1 vol. (XIII-464 p.), Lecture notes in computer science, 3-540-23306-7 • Distributed Computing, Texte imprimé, 9783662184882 |
Sommario:
- The Synchronous Condition-Based Consensus Hierarchy
- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
- Group-Solvability
- The Notion of Veto Number and the Respective Power of and to Solve One-Shot Agreement Problems
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
- Local-Spin Group Mutual Exclusion Algorithms
- On Quorum Systems for Group Resources with Bounded Capacity
- Bounded Version Vectors
- An Optimistic Approach to Lock-Free FIFO Queues
- A Single-Enqueuer Wait-Free Queue Implementation
- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS
- Efficient Adaptive Collect Using Randomization
- Nonblocking Concurrent Data Structures with Condition Synchronization
- Dynamic Memory ABP Work-Stealing
- Coupling and Self-stabilization
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
- Virtual Mobile Nodes for Mobile Ad Hoc Networks
- Contention-Free MAC Protocols for Wireless Sensor Networks
- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion
- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
- Routing with Improved Communication-Space Trade-Off
- Active and Concurrent Topology Maintenance
- Distributed Weighted Matching
- Exploiting Content Localities for Efficient Search in P2P Systems
- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs
- Towards a Theory of Consistency Primitives
- Fault-Tolerant Storage in a Dynamic Environment
- Non-skipping Timestamps for Byzantine Data Storage Systems
- Efficient Verification for Provably Secure Storage andSecret Sharing in Systems Where Half the Servers Are Faulty
- Optimal Dispersal of Certificate Chains
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs.