Distributed Computing : 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings / edited by Yehuda Afek.

Format:

Book

Contributor:

Afek, Yehuda., Editor.

SpringerLink (Online service)

Series:

Computer Science (SpringerNature-11645)

LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8205

Theoretical Computer Science and General Issues, 2512-2029 ; 8205

Language:

English

Subjects (All):

Algorithms.

Computer networks.

Data structures (Computer science).

Information theory.

Computer Communication Networks.

Data Structures and Information Theory.

Local Subjects:

Algorithms.

Computer Communication Networks.

Data Structures and Information Theory.

Physical Description:

1 online resource (XXIV, 586 pages) : 54 illustrations

Edition:

1st ed. 2013.

Contained In:

Springer Nature eBook

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.

System Details:

text file PDF

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.

Contents:

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 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.

Other Format:

Printed edition:

ISBN:

978-3-642-41527-2

9783642415272

Access Restriction:

Restricted for use by site license.