Distributed Computing

27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings

Editors:

ISBN: 978-3-642-41526-5 (Print) 978-3-642-41527-2 (Online)

Table of contents (37 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Graph Problems in the Message Passing Model

    1. No Access

      Book Chapter

      Pages 1-15

      Distributed Minimum Cut Approximation

    2. No Access

      Book Chapter

      Pages 16-30

      When Distributed Computation Is Communication Expensive

  3. Topology, Leader Election, and Spanning Trees

    1. No Access

      Book Chapter

      Pages 31-45

      Use Knowledge to Learn Faster: Topology Recognition with Advice

    2. No Access

      Book Chapter

      Pages 46-60

      An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election

    3. No Access

      Book Chapter

      Pages 61-75

      Distributed Protocols for Leader Election: A Game-Theoretic Perspective

    4. No Access

      Book Chapter

      Pages 76-90

      Compact Deterministic Self-stabilizing Leader Election

    5. No Access

      Book Chapter

      Pages 91-105

      Time Optimal Synchronous Self Stabilizing Spanning Tree

  4. Software Transactional Memory

    1. No Access

      Book Chapter

      Pages 106-120

      Proving Non-opacity

    2. No Access

      Book Chapter

      Pages 121-133

      Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration

    3. No Access

      Book Chapter

      Pages 134-148

      Generic Multiversion STM

    4. No Access

      Book Chapter

      Pages 149-163

      Practical Parallel Nesting for Software Transactional Memory

  5. Shared Memory Executions

    1. No Access

      Book Chapter

      Pages 164-178

      Asynchronous Resilient Linearizability

    2. No Access

      Book Chapter

      Pages 179-193

      Fair Synchronization

  6. Gossip and Rumor

    1. No Access

      Book Chapter

      Pages 194-208

      Gossip Protocols for Renaming and Sorting

    2. No Access

      Book Chapter

      Pages 209-223

      Faster Rumor Spreading: Breaking the logn Barrier

  7. Shared Memory Tasks and Data Structures

    1. No Access

      Book Chapter

      Pages 224-238

      Lock-Free Data-Structure Iterators

    2. No Access

      Book Chapter

      Pages 239-253

      Practical Non-blocking Unordered Lists

    3. No Access

      Book Chapter

      Pages 254-268

      Atomic Snapshots in O(log3 n) Steps Using Randomized Helping

    4. No Access

      Book Chapter

      Pages 269-283

      Adaptive Register Allocation with a Linear Number of Registers

    5. No Access

      Book Chapter

      Pages 284-298

      An Optimal Implementation of Fetch-and-Increment

previous Page of 2