LEADER 06450nam 22007095 450 001 996466273403316 005 20230222040504.0 010 $a3-642-15763-7 024 7 $a10.1007/978-3-642-15763-9 035 $a(CKB)2670000000036418 035 $a(SSID)ssj0000737082 035 $a(PQKBManifestationID)11422503 035 $a(PQKBTitleCode)TC0000737082 035 $a(PQKBWorkID)10782706 035 $a(PQKB)11758377 035 $a(DE-He213)978-3-642-15763-9 035 $a(MiAaPQ)EBC3065700 035 $a(PPN)149018223 035 $a(EXLCZ)992670000000036418 100 $a20100824d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing$b[electronic resource] $e24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010, Proceedings /$fedited by Nancy A. Lynch, Alexander A. Shvartsman 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XV, 532 p. 85 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6343 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-15762-9 320 $aIncludes bibliographical references and index. 327 $aThe 2010 Edsger W. Dijkstra Prize in Distributed Computing -- The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- Invited Lecture I: Consensus (Session 1a) -- The Power of Abstraction -- Fast Asynchronous Consensus with Optimal Resilience -- Transactions (Session 1b) -- Transactions as the Foundation of a Memory Consistency Model -- The Cost of Privatization -- A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware -- Window-Based Greedy Contention Management for Transactional Memory -- Shared Memory Services and Concurrency (Session 1c) -- Scalable Flat-Combining Based Synchronous Queues -- Fast Randomized Test-and-Set and Renaming -- Concurrent Computing and Shellable Complexes -- Brief Announcements I (Session 1d) -- Brief Announcement: Hybrid Time-Based Transactional Memory -- Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Wireless Networks (Session 1e) -- What Is the Use of Collision Detection (in Wireless Networks)? -- Deploying Wireless Networks with Beeps -- Distributed Contention Resolution in Wireless Networks -- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks -- Brief Announcements II (Session 1f) -- Brief Announcement: Simple Gradecast Based Algorithms -- Brief Announcement: Decentralized Network Bandwidth Prediction -- Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT -- Invited Lecture II: Best Student Paper (Session 2a) -- Foundations of Speculative Distributed Computing -- Anonymous Asynchronous Systems: The Case of Failure Detectors -- Consensus and Leader Election (Session 2b) -- The Computational Structure of Progress Conditions -- Scalable Quantum Consensus for Crash Failures -- How Much Memory Is Needed for Leader Election -- Leader Election Problem versus Pattern Formation Problem -- Mobile Agents (Session 2c) -- Rendezvous of Mobile Agents in Directed Graphs -- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids -- Exclusive Perpetual Ring Exploration without Chirality -- Drawing Maps with Advice -- Invited Lecture III: Wireless Networks (Session 3a) -- Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks -- Connectivity Problem in Wireless Networks -- Computing in Wireless and Mobile Networks (Session 3b) -- Trusted Computing for Fault-Prone Wireless Networks -- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony -- Brief Announcements III (Session 3c) -- Brief Announcement: Failure Detectors Encapsulate Fairness -- Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study -- Brief Announcement: On Reversible and Irreversible Conversions -- Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting -- Brief Announcement: Flash-Log ? A High Throughput Log -- Brief Announcement: New Bounds for Partially Synchronous Set Agreement -- Modeling Issues and Adversity (Session 3d) -- It?s on Me! The Benefit of Altruism in BAR Environments -- Beyond Lamport?s Happened-Before: On the Role of Time Bounds in Synchronous Systems -- On the Power of Non-spoofing Adversaries -- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication -- Self-stabilizing and Graph Algortihms (Session 3e) -- Low Communication Self-stabilization through Randomization -- Fast Self-stabilizing Minimum Spanning Tree Construction -- The Impact of Topology on Byzantine Containment in Stabilization -- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity -- Brief Announcements IV (Session 3f) -- Brief Announcement: Sharing Memory in a Self-stabilizing Manner -- Brief Announcement: Stabilizing Consensus with the Power of Two Choices. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6343 606 $aComputer networks 606 $aSoftware engineering 606 $aApplication software 606 $aAlgorithms 606 $aComputer programming 606 $aComputer Communication Networks 606 $aSoftware Engineering 606 $aComputer and Information Systems Applications 606 $aAlgorithms 606 $aProgramming Techniques 615 0$aComputer networks. 615 0$aSoftware engineering. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer programming. 615 14$aComputer Communication Networks. 615 24$aSoftware Engineering. 615 24$aComputer and Information Systems Applications. 615 24$aAlgorithms. 615 24$aProgramming Techniques. 676 $a004.6 702 $aLynch$b Nancy A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShvartsman$b Alexander A$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466273403316 996 $aDistributed computing$9104445 997 $aUNISA