| 000 | 05929nam a22004935i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-41527-2 | ||
| 003 | DE-He213 | ||
| 005 | 20140220082922.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 131004s2013 gw | s |||| 0|eng d | ||
| 020 |
_a9783642415272 _9978-3-642-41527-2 |
||
| 024 | 7 |
_a10.1007/978-3-642-41527-2 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aAfek, Yehuda. _eeditor. |
|
| 245 | 1 | 0 |
_aDistributed Computing _h[electronic resource] : _b27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings / _cedited by Yehuda Afek. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
| 300 |
_aXXIV, 586 p. 54 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 ; _v8205 |
|
| 505 | 0 | _aDistributed Minimum Cut Approximation -- When Distributed Computation Is Communication Expensive -- An O(√n) Space Bound for Obstruction-Free Leader Election -- Distributed Protocols for Leader Election: A Game-Theoretic Perspective -- Compact Deterministic Self-stabilizing Leader Election: The Exponential Advantage of Being Talkative -- Time Optimal Synchronous Self Stabilizing Spanning Tree -- Proving Non-opacity -- Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration -- Generic Multiversion STM -- Practical Parallel Nesting for Software Transactional Memory -- Asynchronous Resilient Linearizability -- Fair Synchronization -- Gossip Protocols for Renaming and Sorting -- Faster Rumor Spreading: Breaking the log n Barrier -- Lock-Free Data-Structure Iterators -- Practical Non-blocking Unordered Lists -- Atomic Snapshots in O(log3 n) Steps Using Randomized Helping -- Adaptive Register Allocation with a Linear Number of Registers -- An Optimal Implementation of Fetch-and-Increment -- On Barriers and the Gap between Active and Passive Replication -- Conflict Resolution and Membership Problem in Beeping Channels -- Frequency Hopping against a Powerful Adversary -- Sleeping Experts in Wireless Networks -- Broadcast in the Ad Hoc SINR Model -- Distributed Randomized Broadcasting in Wireless Networks under the SINR Model -- Asynchronous Multiparty Computation with Linear Communication Complexity -- Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary -- On the Communication Complexity of Distributed Name-Independent Routing Schemes -- Convergence in (Social) Influence Networks -- Trustful Population Protocols -- Prudent Opportunistic Cognitive Radio Access Protocols -- Braess’s Paradox in Wireless Networks: The Danger of Improved Technology -- Fast Structuring of Radio Networks Large for Multi-message Communications -- In-Network Analytics for Ubiquitous Sensing -- A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location -- CONE-DHT: A Distributed Self-stabilizing Algorithm for a Heterogeneous Storage System -- Brief Announcement: Distributed MST in Core-Periphery Networks -- Brief Announcement: Enhancing Permissiveness in Transactional Memory via Time-Warping -- Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List -- Brief Anouncement: The Topology of Asynchronous Byzantine Colorless Tasks -- Brief Announcement: Revisiting Dynamic Distributed Systems -- Brief Announcement: Computing in the Presence of Concurrent Solo Executions -- Brief Announcement: A Concurrent Lock-Free Red-Black Tree -- Brief Announcement: A General Technique for Non-blocking Trees -- Brief Announcement: Communication-Efficient Byzantine Consensus without a Common Clock -- Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store -- Brief Announcement: BFT Storage with 2t + 1 Data Replicas -- Brief Announcement: Private Channel Models in Multi-party Communication Complexity -- Vinod Vaikuntanathan Brief Announcement: Certified Impossibility Results for Byzantine-Tolerant Mobile Robots -- Brief Announcement: Distributed Compressed Sensing for Sensor Networks -- Brief Announcement: Towards Distributed and Reliable Software Defined Networking -- Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes. | |
| 520 | _aThis book constitutes the proceedings of the 27th International Symposium on Distributed Computing, DISC 2013, held in Jerusalem, Israel, in October 2013. The 27 full papers presented in this volume were carefully reviewed and selected from 142 submissions; 16 brief announcements are also included. The papers are organized in topical sections named: graph distributed algorithms; topology, leader election, and spanning trees; software transactional memory; shared memory executions; shared memory and storage; gossip and rumor; shared memory tasks and data structures; routing; radio networks and the SINR model; crypto, trust, and influence; and networking. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aComputer software. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aData Structures, Cryptology and Information Theory. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642415265 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8205 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-41527-2 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 |
_c98778 _d98778 |
||