Distributed Computing

Distributed Minimum Cut Approximation.- When Distributed Computation Is Communication Expensive.- An O(Vn) 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.