000 03618nam a22006135i 4500
001 978-3-540-39989-6
003 DE-He213
005 20240423132550.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540399896
_9978-3-540-39989-6
024 7 _a10.1007/b13831
_2doi
050 4 _aQA76.9.S88
072 7 _aUYD
_2bicssc
072 7 _aCOM011000
_2bisacsh
072 7 _aUYD
_2thema
082 0 4 _a004.2
_223
245 1 0 _aDistributed Computing
_h[electronic resource] :
_b17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings /
_cedited by Faith Ellen Fich.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aIX, 371 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2848
505 0 _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.
650 0 _aComputer systems.
650 0 _aComputer networks .
650 0 _aComputer programming.
650 0 _aOperating systems (Computers).
650 0 _aComputer science.
650 0 _aAlgorithms.
650 1 4 _aComputer System Implementation.
650 2 4 _aComputer Communication Networks.
650 2 4 _aProgramming Techniques.
650 2 4 _aOperating Systems.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
700 1 _aFich, Faith Ellen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540201847
776 0 8 _iPrinted edition:
_z9783662215128
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2848
856 4 0 _uhttps://doi.org/10.1007/b13831
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189188
_d189188