Distributed computing : 16th international conference, DISC 2002, Toulouse, France, October 28-30, 2002 : proceedings
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
2508 |
| Materias: | |
| Acceso en línea: | 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, 16th international conference, DISC 2002, Toulouse, France, October 28-30, 2002, proceedings, Dahlia Malkhi (ed.), Berlin, Springer, 2002, 1 vol. (X-369 p.), Lecture notes in computer science, 3-540-00073-9 • Distributed Computing, Texte imprimé, 9783662206058 |
Tabla de Contenidos:
- 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.