Distributed Computing

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

  • Shlomi Dolev

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

Table of contents

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

    1. Michael Okun, Amnon Barak
      Pages 16-30
    2. Hagit Attiya, Eshcar Hillel
      Pages 31-45
    3. Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin-Parvédy
      Pages 46-60
    4. Dana Angluin, James Aspnes, David Eisenstat
      Pages 61-75
    5. Doina Bein, Ajoy K. Datta, Lawrence L. Larmore
      Pages 76-89
    6. Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster
      Pages 90-104
    7. Jérémie Chalopin, Shantanu Das, Nicola Santoro
      Pages 105-119
    8. Yoram Moses, Benny Shimony
      Pages 120-135
    9. Joseph Y. Halpern, Sabina Petride
      Pages 136-150
    10. Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott
      Pages 179-193
    11. Dave Dice, Ori Shalev, Nir Shavit
      Pages 194-208
    12. Taisuke Izumi, Toshimitsu Masuzawa
      Pages 224-237
    13. Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira et al.
      Pages 238-253
    14. Alina Oprea, Michael K. Reiter
      Pages 254-268
    15. Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt
      Pages 269-283

About these proceedings


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.


Byzantine processes ad-hoc networks algorithms approximation algorithms broadcasting calculus concurrent programming database distributed applications distributed computing distributed objects distributed systems fault tolerance graph algorithms mobile computing

Editors and affiliations

  • Shlomi Dolev
    • 1
  1. 1.Department of Computer ScienceBen Gurion University of the NegevIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/11864219
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-44624-8
  • Online ISBN 978-3-540-44627-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book