Distributed Computing 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings /
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2002.
|
| Έκδοση: | 1st ed. 2002. |
| Σειρά: | Lecture Notes in Computer Science,
2508 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Early-Delivery Dynamic Atomic Broadcast
- Secure Computation without Agreement
- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
- Condition-Based Protocols for Set Agreement Problems
- Distributed Agreement and Its Relation with Error-Correcting Codes
- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
- Transformations of Self-Stabilizing Algorithms
- Simple Wait-Free Multireader Registers
- An Efficient Universal Construction for Message-Passing Systems
- Ruminations on Domain-Based Reliable Broadcast
- Stateless Termination Detection
- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
- Ad Hoc Membership for Scalable Applications
- Assignment-Based Partitioning in a Condition Monitoring System
- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
- Failure Detection Lower Bounds on Registers and Consensus
- Improved Compact Routing Scheme for Chordal Graphs
- A Practical Multi-word Compare-and-Swap Operation
- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection
- Bounding Work and Communication in Robust Cooperative Computation
- Minimal Byzantine Storage
- Wait-Free n-Set Consensus When Inputs Are Restricted
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.
