04516nam 22007575 450 99646540340331620200703222522.03-540-36108-110.1007/3-540-36108-1(CKB)1000000000211818(SSID)ssj0000322701(PQKBManifestationID)11268124(PQKBTitleCode)TC0000322701(PQKBWorkID)10288515(PQKB)11734347(DE-He213)978-3-540-36108-4(MiAaPQ)EBC3071830(PPN)155215663(EXLCZ)99100000000021181820121227d2002 u| 0engurnn|008mamaatxtccrDistributed Computing[electronic resource] 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings /edited by Dahlia Malkhi1st ed. 2002.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2002.1 online resource (X, 378 p.) Lecture Notes in Computer Science,0302-9743 ;2508Bibliographic Level Mode of Issuance: Monograph3-540-00073-9 Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;2508Computer communication systemsComputersComputer programmingOperating systems (Computers)AlgorithmsComputer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computer 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.004/.36Malkhi Dahliaedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996465403403316Distributed computing104445UNISA