Skip to main content
SpringerLink
Log in
Book cover

Distributed Computing

20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Shlomi Dolev

    1. Department of Computer Science, Ben Gurion University of the Negev, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4167)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: DISC 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (55 papers)

  1. Front Matter

    Download chapter PDF

  2. Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement

    1. Exploring Gafni’s Reduction Land: From Ωk to Wait-Free Adaptive \((2p-\lceil\frac{p}{k}\rceil)\)-Renaming Via k-Set Agreement

      • Achour Mostefaoui, Michel Raynal, Corentin Travers
      Pages 1-15

    2. Renaming in Message Passing Systems with Byzantine Failures

      • Michael Okun, Amnon Barak
      Pages 16-30

    3. Built-In Coloring for Highly-Concurrent Doubly-Linked Lists

      • Hagit Attiya, Eshcar Hillel
      Pages 31-45

    4. Fault-Tolerant and Self-stabilizing Mobile Robots Gathering

      • Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin-Parvédy
      Pages 46-60

    5. Fast Computation by Population Protocols with a Leader

      • Dana Angluin, James Aspnes, David Eisenstat
      Pages 61-75

    6. On Self-stabilizing Search Trees

      • Doina Bein, Ajoy K. Datta, Lawrence L. Larmore
      Pages 76-89

    7. Efficient Dynamic Aggregation

      • Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster
      Pages 90-104

    8. Groupings and Pairings in Anonymous Networks

      • Jérémie Chalopin, Shantanu Das, Nicola Santoro
      Pages 105-119

    9. A New Proof of the GHS Minimum Spanning Tree Algorithm

      • Yoram Moses, Benny Shimony
      Pages 120-135

    10. A Knowledge-Based Analysis of Global Function Computation

      • Joseph Y. Halpern, Sabina Petride
      Pages 136-150

    11. Checking a Multithreaded Algorithm with  + CAL

      • Leslie Lamport
      Pages 151-163

    12. Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture

      • Lisa Higham, LillAnne Jackson, Jalal Kawash
      Pages 164-178

    13. Conflict Detection and Validation Strategies for Software Transactional Memory

      • Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott
      Pages 179-193

    14. Transactional Locking II

      • Dave Dice, Ori Shalev, Nir Shavit
      Pages 194-208

    15. Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects

      • Yehuda Afek, Eran Shalom
      Pages 209-223

    16. One-Step Consensus Solvability

      • Taisuke Izumi, Toshimitsu Masuzawa
      Pages 224-237

    17. Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols

      • Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira et al.
      Pages 238-253

    18. On Consistency of Encrypted Files

      • Alina Oprea, Michael K. Reiter
      Pages 254-268

    19. Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data

      • Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt
      Pages 269-283
Back to top

Other volumes

  1. Distributed Computing

Keywords

About this book

DISC, the International Symposium on DIStributed Computing, is an annual forum for presentation of research on all facets of distributed computing, inc- ding the theory, design, analysis, implementation, and application of distributed systems and networks. The 20th anniversary edition of DISC was held on S- tember 18-20, 2006, in Stockholm, Sweden. There were 145 extended abstracts submitted to DISC this year, and this - lume contains the 35 contributions selected by the Program Committee and one invited paper among these 145 submissions. All submitted papers were read and evaluated by at least three Program Committee members, assisted by external reviewers. The ?nal decision regarding every paper was taken during the P- gram Committee meeting, which took place in Beer-Sheva, June 30 and July 1, 2006. The Best Student Award was split and given to two papers: the paper “- act Distance Labelings Yield Additive-Stretch Compact Routing Schemes,” by Arthur Bradly, and Lenore Cowen, and the paper “A Fast Distributed App- ximation Algorithm for Minimum Spanning Trees” co-authored by Maleq Khan and Gopal Pandurangan. The proceedings also include 13 three-page-long brief announcements (BA). TheseBAsarepresentationsofongoingworksforwhichfullpapersarenotready yet, or of recent results whose full description will soon be or has been recently presented in other conferences. Researchers use the BA track to quickly draw the attention of the community to their experiences, insights and results from ongoing distributed computing research and projects. The BAs included in this proceedings volume were selected among 26 BA submissions.

Editors and Affiliations

  • Department of Computer Science, Ben Gurion University of the Negev, Israel

    Shlomi Dolev

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation