LEADER 04516nam  22007575  450 
001 996465403403316
005 20200703222522.0
010   $a3-540-36108-1
024 7 $a10.1007/3-540-36108-1
035   $a(CKB)1000000000211818
035   $a(SSID)ssj0000322701
035   $a(PQKBManifestationID)11268124
035   $a(PQKBTitleCode)TC0000322701
035   $a(PQKBWorkID)10288515
035   $a(PQKB)11734347
035   $a(DE-He213)978-3-540-36108-4
035   $a(MiAaPQ)EBC3071830
035   $a(PPN)155215663
035   $a(EXLCZ)991000000000211818
100   $a20121227d2002      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDistributed Computing$b[electronic resource] $e16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings /$fedited by Dahlia Malkhi
205   $a1st ed. 2002.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002.
215   $a1 online resource (X, 378 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2508
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-00073-9 
320   $aIncludes bibliographical references and index.
327   $aEarly-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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2508
606   $aComputer communication systems
606   $aComputers
606   $aComputer programming
606   $aOperating systems (Computers)
606   $aAlgorithms
606   $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
615  0$aComputer communication systems.
615  0$aComputers.
615  0$aComputer programming.
615  0$aOperating systems (Computers).
615  0$aAlgorithms.
615 14$aComputer Communication Networks.
615 24$aTheory of Computation.
615 24$aProgramming Techniques.
615 24$aOperating Systems.
615 24$aComputation by Abstract Devices.
615 24$aAlgorithm Analysis and Problem Complexity.
676   $a004/.36
702   $aMalkhi$b Dahlia$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465403403316
996   $aDistributed computing$9104445
997   $aUNISA