Skip to main content
  • Conference proceedings
  • © 2007

Distributed Computing

21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings

Editors:

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

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

Conference series link(s): DISC: International Symposium on Distributed Computing

Conference proceedings info: DISC 2007.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (48 papers)

  1. Front Matter

  2. Invited Talks

    1. Routing and Scheduling with Incomplete Information

      • Burkhard Monien, Karsten Tiemann
      Pages 1-2
  3. Regular Papers

    1. A Simple Population Protocol for Fast Robust Approximate Majority

      • Dana Angluin, James Aspnes, David Eisenstat
      Pages 20-32
    2. A Denial-of-Service Resistant DHT

      • Baruch Awerbuch, Christian Scheideler
      Pages 33-47
    3. Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks

      • Roberto Baldoni, Kleoni Ioannidou, Alessia Milani
      Pages 48-62
    4. Self-stabilizing Counting in Mobile Sensor Networks with a Base Station

      • Joffroy Beauquier, Julien Clement, Stephane Messika, Laurent Rosaz, Brigitte Rozoy
      Pages 63-76
    5. Scalable Load-Distance Balancing

      • Edward Bortnikov, Israel Cidon, Idit Keidar
      Pages 77-91
    6. Time Optimal Asynchronous Self-stabilizing Spanning Tree

      • Janna Burman, Shay Kutten
      Pages 92-107
    7. Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links

      • Jérémie Chalopin, Shantanu Das, Nicola Santoro
      Pages 108-122
    8. Weakening Failure Detectors for k-Set Agreement Via the Partition Approach

      • Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu
      Pages 123-138
    9. Amnesic Distributed Storage

      • Gregory Chockler, Rachid Guerraoui, Idit Keidar
      Pages 139-151
    10. Distributed Approximations for Packing in Unit-Disk Graphs

      • Andrzej Czygrinow, MichaÅ‚ Hańćkowiak
      Pages 152-164
    11. From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors

      • Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling, Lucia Draque Penso, Andreas Tielmann
      Pages 165-178
    12. Gossiping in a Multi-channel Radio Network

      • Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calvin Newport
      Pages 208-222
    13. The Space Complexity of Unbounded Timestamps

      • Faith Ellen, Panagiota Fatourou, Eric Ruppert
      Pages 223-237

Other Volumes

  1. Distributed Computing

Keywords

  • Byzantine processes
  • Routing
  • ad-hoc networks
  • algorithms
  • approximation algorithms
  • broadcasting
  • complexity
  • concurrent programming
  • data structure
  • distributed algorithms
  • distributed applications
  • distributed computing
  • distributed objects
  • distributed systems
  • logic
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions