top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Distributed Computing [[electronic resource] ] : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / / edited by Dahlia Malkhi
Distributed Computing [[electronic resource] ] : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / / edited by Dahlia Malkhi
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (X, 378 p.)
Disciplina 004/.36
Collana Lecture Notes in Computer Science
Soggetto topico Computer communication systems
Computers
Computer programming
Operating systems (Computers)
Algorithms
Computer Communication Networks
Theory of Computation
Programming Techniques
Operating Systems
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
ISBN 3-540-36108-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNISA-996465403403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Distributed Computing : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / / edited by Dahlia Malkhi
Distributed Computing : 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings / / edited by Dahlia Malkhi
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (X, 378 p.)
Disciplina 004/.36
Collana Lecture Notes in Computer Science
Soggetto topico Computer communication systems
Computers
Computer programming
Operating systems (Computers)
Algorithms
Computer Communication Networks
Theory of Computation
Programming Techniques
Operating Systems
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
ISBN 3-540-36108-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910143896403321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui