Distributed Computing: 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings: Lecture Notes in Computer Science, cartea 8205
Editat de Yehuda Afeken Limba Engleză Paperback – 7 oct 2013
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 567.60 lei
- 20% Preț: 238.01 lei
- 15% Preț: 568.74 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 373.56 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 632.22 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 809.19 lei
- 20% Preț: 579.56 lei
- 20% Preț: 649.49 lei
- 20% Preț: 330.23 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 326.98 lei
- 20% Preț: 256.27 lei
- 20% Preț: 444.17 lei
- 20% Preț: 571.63 lei
- 20% Preț: 575.48 lei
- 20% Preț: 574.05 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 747.79 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 569.19 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 340.90 lei
Preț vechi: 426.13 lei
-20% Nou
Puncte Express: 511
Preț estimativ în valută:
65.25€ • 68.45$ • 54.13£
65.25€ • 68.45$ • 54.13£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642415265
ISBN-10: 3642415261
Pagini: 605
Ilustrații: XXIV, 586 p. 54 illus.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.84 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642415261
Pagini: 605
Ilustrații: XXIV, 586 p. 54 illus.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.84 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Distributed 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 BipartiteMetric 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.
Caracteristici
Proceedings of the International Symposium on Distributed Computing, DISC 2013