| Description |
1 online resource (xxiv, 586 pages) : illustrations |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 8205 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 8205. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Graph Problems in the Message Passing Model -- Distributed Minimum Cut Approximation / Mohsen Ghaffari and Fabian Kuhn -- When Distributed Computation Is Communication Expensive / David P. Woodruff and Qin Zhang -- Topology, Leader Election, and Spanning Trees -- Use Knowledge to Learn Faster: Topology Recognition with Advice / Emanuele Guido Fusco, Andrzej Pelc and Rossella Petreschi -- An O Space Bound for Obstruction-Free Leader Election / George Giakkoupis [and others] -- Distributed Protocols for Leader Election: A Game-Theoretic Perspective / Ittai Abraham, Danny Dolev and Joseph Y. Halpern -- Compact Deterministic Self-stabilizing Leader Election / Lélia Blin and Sébastien Tixeuil -- Time Optimal Synchronous Self Stabilizing Spanning Tree / Alex Kravchik and Shay Kutten -- Software Transactional Memory -- Proving Non-opacity / Mohsen Lesani and Jens Palsberg |
|
Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration / Danny Hendler [and others] -- Generic Multiversion STM / Li Lu and Michael L. Scott -- Practical Parallel Nesting for Software Transactional Memory / Nuno Diegues and João Cachopo -- Shared Memory Executions -- Asynchronous Resilient Linearizability / Sagar Chordia [and others] -- Fair Synchronization / Gadi Taubenfeld -- Gossip and Rumor -- Gossip Protocols for Renaming and Sorting / George Giakkoupis, Anne-Marie Kermarrec and Philipp Woelfel -- Faster Rumor Spreading: Breaking the logn Barrier / Chen Avin and Robert Elsässer -- Shared Memory Tasks and Data Structures -- Lock-Free Data-Structure Iterators / Erez Petrank and Shahar Timnat -- Practical Non-blocking Unordered Lists / Kunlong Zhang [and others] -- Atomic Snapshots in O(log3 n) Steps Using Randomized Helping / James Aspnes and Keren Censor-Hillel |
|
Adaptive Register Allocation with a Linear Number of Registers / Carole Delporte-Gallet [and others] -- An Optimal Implementation of Fetch-and-Increment / Faith Ellen and Philipp Woelfel -- Replication and Consensus -- On Barriers and the Gap between Active and Passive Replication / Flavio P. Junqueira and Marco Serafini -- Wireless Networks -- Conflict Resolution and Membership Problem in Beeping Channels / Bojun Huang and Thomas Moscibroda -- Frequency Hopping against a Powerful Adversary / Yuval Emek and Roger Wattenhofer -- Sleeping Experts in Wireless Networks / Johannes Dams, Martin Hoefer and Thomas Kesselheim -- Broadcast in the Ad Hoc SINR Model / Sebastian Daum [and others] -- Distributed Randomized Broadcasting in Wireless Networks under the SINR Model / Tomasz Jurdzinski [and others] -- Crypto, Trust, and Influence -- Asynchronous Multiparty Computation with Linear Communication Complexity / Ashish Choudhury, Martin Hirt and Arpita Patra |
|
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary / Paul Bunn and Rafail Ostrovsky -- On the Communication Complexity of Distributed Name-Independent Routing Schemes / Cyril Gavoille [and others] -- Convergence in (Social) Influence Networks / Silvio Frischknecht, Barbara Keller and Roger Wattenhofer -- Trustful Population Protocols / Olivier Bournez, Jonas Lefevre and Mikaël Rabie -- Networking -- Prudent Opportunistic Cognitive Radio Access Protocols / Israel Cidon, Erez Kantor and Shay Kutten -- Braess's Paradox in Wireless Networks: The Danger of Improved Technology / Michael Dinitz and Merav Parter -- Fast Structuring of Radio Networks Large for Multi-message Communications / Mohsen Ghaffari and Bernhard Haeupler -- In-Network Analytics for Ubiquitous Sensing / Ittay Eyal [and others] -- A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location / James Hegeman and Sriram V. Pemmaraju -- CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System / Sebastian Kniesburges, Andreas Koutsopoulos and Christian Scheideler |
| Summary |
This 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 |
| Notes |
International conference proceedings |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed October 7, 2013) |
| Subject |
Electronic data processing -- Distributed processing -- Congresses
|
|
Electronic Data Processing
|
|
Electronic data processing -- Distributed processing
|
|
Engineering & Applied Sciences.
|
|
Computer Science.
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Afek, Yehuda, 1952- editor.
|
| ISBN |
9783642415272 |
|
364241527X |
|
3642415261 |
|
9783642415265 |
|
