000 | 06046nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-642-15763-9 | ||
003 | DE-He213 | ||
005 | 20160624102149.0 | ||
007 | cr nn 008mamaa | ||
008 | 100824s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642157639 _9978-3-642-15763-9 |
||
024 | 7 |
_a10.1007/978-3-642-15763-9 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM075000 _2bisacsh |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aDistributed Computing _h[electronic resource] : _b24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings / _cedited by Nancy A. Lynch, Alexander A. Shvartsman. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
300 |
_aXV, 532p. 85 illus. _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, _x0302-9743 ; _v6343 |
|
505 | 0 | _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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aInformation systems. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aInformation Systems Applications (incl.Internet). |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aLynch, Nancy A. _eeditor. |
|
700 | 1 |
_aShvartsman, Alexander A. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642157622 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6343 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-15763-9 |
942 |
_2EBK9297 _cEBK |
||
999 |
_c38591 _d38591 |