LEADER 06822nam 22007815 450 001 996465278703316 005 20200704230100.0 010 $a3-540-30186-0 024 7 $a10.1007/b101206 035 $a(CKB)1000000000212592 035 $a(DE-He213)978-3-540-30186-8 035 $a(SSID)ssj0000140120 035 $a(PQKBManifestationID)11160774 035 $a(PQKBTitleCode)TC0000140120 035 $a(PQKBWorkID)10029348 035 $a(PQKB)10464928 035 $a(MiAaPQ)EBC3089078 035 $a(PPN)155168363 035 $a(EXLCZ)991000000000212592 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDistributed Computing$b[electronic resource] $e18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-8, 2004. Proceedings /$fedited by Rachid Guerraoui 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIV, 470 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3274 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-23306-7 320 $aIncludes bibliographical references and index. 327 $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 and Secret Sharing in Systems Where Half the Servers Are Faulty -- Optimal Dispersal of Certificate Chains -- On Byzantine Agreement over (2,3)-Uniform Hypergraphs. 330 $aDISC, the International Symposium on Distributed Computing, is an annual conference for the presentation of research on the theory, design, analysis, implementation, and application of distributed systems and network. DISC 2004 was held on October 4?7, 2004, in Amsterdam, The Netherlands. There were 142 papers submitted to DISC this year. These were read and evaluated by the program committee members, assisted by external reviewers. The quality of submissions was high and we were unable to accept many dese- ing papers. Thirty one papers were selected at the program committee meeting in Lausanne to be included in these proceedings. The proceedings include an extended abstract of the invited talk by Ueli Maurer. In addition, they include a eulogy for Peter Ruzicka by Shmuel Zaks. The Best Student Paper Award was split and given to two papers: the paper ?Efficient Adaptive Collect Using Randomization?, co-authored by Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer and Roger Wattenhofer, and the paper ?Coupling and Self-stabilization?,co-authored by Laurent Fribourg, Stephane Messika and Claudine Picaronny. The support of the CWI and EPFL is gratefully acknowledged. The review process and the preparation of this volume were done using CyberChairPRO. I also thank Sebastien Baehni and Sidath Handurukande for their crucial help with these matters. August 2004 Rachid Guerraoui Peter Ruzicka 1947?2003 Peter died on Sunday, October 5, 2003, at the age of 56, after a short disease. He was a Professor of Informatics at the Faculty of Mathematics, Physics and Informatics in Comenius University, Bratislava, Slovakia. Those of us who knew him through DISC and other occasions mourn his death and cherish his memory. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3274 606 $aComputers 606 $aComputer communication systems 606 $aAlgorithms 606 $aComputer programming 606 $aOperating systems (Computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aComputers. 615 0$aComputer communication systems. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aOperating systems (Computers). 615 14$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aOperating Systems. 676 $a004.36 702 $aGuerraoui$b Rachid$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aDISC 2004 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465278703316 996 $aDistributed computing$9104445 997 $aUNISA