LEADER 06037nam 22008535 450 001 9910483878503321 005 20251226202521.0 010 $a9783540320753 024 7 $a10.1007/11561927 035 $a(CKB)1000000000213896 035 $a(SSID)ssj0000317260 035 $a(PQKBManifestationID)11231545 035 $a(PQKBTitleCode)TC0000317260 035 $a(PQKBWorkID)10287845 035 $a(PQKB)11183436 035 $a(DE-He213)978-3-540-32075-3 035 $a(MiAaPQ)EBC4975987 035 $a(Au-PeEL)EBL4975987 035 $a(CaONFJC)MIL139137 035 $a(OCoLC)1024286792 035 $a(MiAaPQ)EBC6806050 035 $a(Au-PeEL)EBL6806050 035 $a(OCoLC)262681427 035 $a(PPN)123097908 035 $a(MiAaPQ)EBC5585542 035 $a(EXLCZ)991000000000213896 100 $a20101108d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing $e19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings /$fedited by Pierre Fraigniaud 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XIV, 522 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3724 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-29163-6 311 08$a3-540-32075-X 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks -- Securing the Net: Challenges, Failures and Directions -- Regular Papers -- Coterie Availability in Sites -- Keeping Denial-of-Service Attackers in the Dark -- On Conspiracies and Hyperfairness in Distributed Computing -- On the Availability of Non-strict Quorum Systems -- Musical Benches -- Obstruction-Free Algorithms Can Be Practically Wait-Free -- Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System -- Non-blocking Hashtables with Open Addressing -- Computing with Reads and Writes in the Absence of Step Contention -- Restricted Stack Implementations -- Proving Atomicity: An Assertional Approach -- Time and Space Lower Bounds for Implementations Using k-CAS -- (Almost) All Objects Are Universal in Message Passing Systems -- ? Meets Paxos: Leader Election and Stability Without Eventual Timely Links -- Plausible Clocks with Bounded Inaccuracy -- Causing Communication Closure: Safe Program Composition with Non-FIFO Channels -- What Can Be Implemented Anonymously? -- Waking Up Anonymous Ad Hoc Radio Networks -- Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs -- Distributed Computing with Imperfect Randomness -- Polymorphic Contention Management -- Distributed Transactional Memory for Metric-Space Networks -- Concise Version Vectors in WinFS -- Adaptive Software Transactional Memory -- Optimistic Generic Broadcast -- Space and Step Complexity Efficient Adaptive Collect -- Observing Locally Self-stabilization in a Probabilistic Way -- Asymptotically Optimal Solutions for Small World Graphs -- Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time,.-Compact Routing for Graphs Excluding a Fixed Minor -- General Compact Labeling Schemes for Dynamic Trees -- The Dynamic And-Or Quorum System -- Brief Announcements -- Byzantine Clients Rendered Harmless -- Reliably Executing Tasks in the Presence of Malicious Processors -- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example -- Communication-Efficient Implementation of Failure Detector Classes and -- Optimal Resilience for Erasure-Coded Byzantine Distributed Storage -- Agreement Among Unacquainted Byzantine Generals -- Subscription Propagation and Content-Based Routing with Delivery Guarantees -- Asynchronous Verifiable Information Dispersal -- Towards a Theory of Self-organization -- Timing Games and Shared Memory -- A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters -- Could any Graph be Turned into a Small-World? -- Papillon: Greedy Routing in Rings -- An Efficient Long-Lived Adaptive Collect Algorithm. 330 $aThis book constitutes the refereed proceedings of the 19th International Conference on Distributed Computing, DISC 2005, held in Cracow, Poland, in September 2005. The 32 revised full papers selected from 162 submissions are presented together with 14 brief announcements of ongoing works chosen from 30 submissions; all of them were carefully selected for inclusion in the book. The entire scope of current issues in distributed computing is addressed, ranging from foundational and theoretical topics to algorithms and systems issues and to applications in various fields. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3724 606 $aComputer science 606 $aComputer networks 606 $aAlgorithms 606 $aComputer programming 606 $aOperating systems (Computers) 606 $aTheory of Computation 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aProgramming Techniques 606 $aOperating Systems 615 0$aComputer science. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aProgramming Techniques. 615 24$aOperating Systems. 676 $a004.36 702 $aFraigniaud$b Pierre 712 02$aSpringerLink (Online service) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483878503321 996 $aDistributed computing$9104445 997 $aUNINA