LEADER 04618nam 22007935 450 001 996465784303316 005 20200701171946.0 010 $a3-540-39989-5 024 7 $a10.1007/b13831 035 $a(CKB)1000000000212206 035 $a(SSID)ssj0000322700 035 $a(PQKBManifestationID)11275887 035 $a(PQKBTitleCode)TC0000322700 035 $a(PQKBWorkID)10288087 035 $a(PQKB)11153074 035 $a(DE-He213)978-3-540-39989-6 035 $a(MiAaPQ)EBC3087966 035 $a(PPN)155193716 035 $a(EXLCZ)991000000000212206 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing$b[electronic resource] $e17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings /$fedited by Faith Ellen Fich 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (IX, 371 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2848 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20184-X 320 $aIncludes bibliographical references and index. 327 $aResilient Consensus for Infinitely Many Processes -- Uniform Solvability with a Finite Number of MWMR Registers -- Timing-Based Mutual Exclusion with Local Spinning -- On the Uncontended Complexity of Consensus -- Probabilistic Quorums for Dynamic Systems -- Efficient Replication of Large Data Objects -- On the Locality of Consistency Conditions -- Multi-writer Consistency Conditions for Shared Memory Objects -- Booting Clock Synchronization in Partially Synchronous Systems -- Automatic Discovery of Mutual Exclusion Algorithms -- On the Implementation Complexity of Specifications of Concurrent Programs -- Competitive Management of Non-preemptive Queues with Multiple Values -- Constructing Disjoint Paths for Secure Communication -- Compact Routing for Flat Networks -- Lower Bounds for Oblivious Single-Packet End-to-End Communication -- Efficient Gossip and Robust Distributed Computation -- Condition-Based Consensus in Synchronous Systems -- Using Conditions to Expedite Consensus in Synchronous Distributed Systems -- Tight Bounds on Early Local Decisions in Uniform Consensus -- Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors -- On Failure Detectors and Type Boosters -- GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks -- Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks -- Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems -- Overcoming the Majority Barrier in Large-Scale Systems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2848 606 $aArchitecture, Computer 606 $aComputer communication systems 606 $aComputer programming 606 $aOperating systems (Computers) 606 $aComputers 606 $aAlgorithms 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 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$aArchitecture, Computer. 615 0$aComputer communication systems. 615 0$aComputer programming. 615 0$aOperating systems (Computers). 615 0$aComputers. 615 0$aAlgorithms. 615 14$aComputer System Implementation. 615 24$aComputer Communication Networks. 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 $aFich$b Faith Ellen$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aDISC 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465784303316 996 $aDistributed computing$9104445 997 $aUNISA