000 04054nam a22005895i 4500
001 978-3-540-30186-8
003 DE-He213
005 20240423125154.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540301868
_9978-3-540-30186-8
024 7 _a10.1007/b101206
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDistributed Computing
_h[electronic resource] :
_b18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-8, 2004. Proceedings /
_cedited by Rachid Guerraoui.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXIV, 470 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 ;
_v3274
505 0 _aThe Synchronous Condition-Based Consensus Hierarchy -- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality -- Group-Solvability -- The Notion of Veto Number and the Respective Power of and to Solve One-Shot Agreement Problems -- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms -- Local-Spin Group Mutual Exclusion Algorithms -- On Quorum Systems for Group Resources with Bounded Capacity -- Bounded Version Vectors -- An Optimistic Approach to Lock-Free FIFO Queues -- A Single-Enqueuer Wait-Free Queue Implementation -- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS -- Efficient Adaptive Collect Using Randomization -- Nonblocking Concurrent Data Structures with Condition Synchronization -- Dynamic Memory ABP Work-Stealing -- Coupling and Self-stabilization -- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings -- Virtual Mobile Nodes for Mobile Ad Hoc Networks -- Contention-Free MAC Protocols for Wireless Sensor Networks -- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems -- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion -- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies -- Routing with Improved Communication-Space Trade-Off -- Active and Concurrent Topology Maintenance -- Distributed Weighted Matching -- Exploiting Content Localities for Efficient Search in P2P Systems -- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs -- Towards a Theory of Consistency Primitives -- Fault-Tolerant Storage in a Dynamic Environment -- Non-skipping Timestamps for Byzantine Data Storage Systems -- Efficient Verification for Provably Secure Storage andSecret Sharing in Systems Where Half the Servers Are Faulty -- Optimal Dispersal of Certificate Chains -- On Byzantine Agreement over (2,3)-Uniform Hypergraphs.
650 0 _aComputer science.
650 0 _aComputer networks .
650 0 _aAlgorithms.
650 0 _aComputer programming.
650 0 _aOperating systems (Computers).
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Communication Networks.
650 2 4 _aAlgorithms.
650 2 4 _aProgramming Techniques.
650 2 4 _aOperating Systems.
700 1 _aGuerraoui, Rachid.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540233060
776 0 8 _iPrinted edition:
_z9783662184882
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3274
856 4 0 _uhttps://doi.org/10.1007/b101206
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c175046
_d175046