Archives
1985-2009

18th International Symposium on Distributed Computing

Amsterdam, Netherlands, October 4-8, 2004

The proceedings of the conference is edited by
Rachid Guerraoui
In: Lecture Nodes in Computer Science Vol. 3274/2004, Springer-Verlag GmbH, 2004,
ISBN 0302-9743.

List of papers:

Accepted Papers

• Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal : The Synchronous Condition-Based Consensus Hierarchy,
  pages 1-15.
• Taisuke Izumi and Toshimitsu Masuzawa : Synchronous Condition-based Consensus Adapting to Input-vector Legality,
  pages 16-29.
• Eli Gafni : Group-Solvability,
  pages 30-40.
• Roy Friedman and Achour Mostefaoui and Michel Raynal : On the Respective Power of P and S to Solve One-Shot Agreement Problems,
  pages 41-55.
• Gadi Taubenfeld : The Black-White Bakery Algorithm,
  pages 56-71.
• Robert Danek and Vassos Hadzilacos : Local-Spin Group Mutual Exclusion Algorithms,
  pages 71-85.
• Yuh-Jzer Joung : On Quorum Systems for Group Resources with Bounded Capacity,
  pages 86-101.
• Jose Bacelar Almeida and Paulo Sergio Almeida and Carlos Baquero : Bounded Version Vectors,
  pages 102-116.
• Edya Ladan-Mozes and Nir Shavit : An Optimistic Approach to Lock-Free FIFO Queues,
  pages 117-131.
• Matei David : A Single-Enqueuer Wait-Free Queue Implementation,
  pages 132-143.
• Maged Michael : Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS,
  pages 144-158.
• Hagit Attiya and Fabian Kuhn and Mirjam Wattenhofer and Roger Wattenhofer : Efficient Adaptive Collect using Randomization,
  pages 159-173.
• William N.Scherer III and Michael L.Scott : Nonblocking Concurrent Data Structures with Condition Synchronization,
  pages 174-187.
• Danny Hendler and Yossi Lev and Nir Shavit : Dynamic Memory ABP Work-Stealing,
  pages 188-200.
• Laurent Fribourg and Stephane Messika and Claudine Picaronny : Coupling and Self-Stabilization,
  pages 201-214.
• Philippe Duchon and Nicolas Hanusse and Sebastien Tixeuil : Optimal Self-stabilizing Mutual Exclusion on Synchronous Rings,
  pages 215-229.
• Shlomi Dolev and Seth Gilbert and Nancy Lynch and Elad Schiller and Alex Shvartsman and Jennifer Welch : Virtual Mobile Nodes for Mobile \Adhoc Networks,
  pages 230-244.
• Costas Busch and Malik Magdon-Ismail and Fikret Sivrikaya and Bulent Yener : Contention-Free MAC protocols for Wireless Sensor Networks,
  pages 245-259.
• James Aspnes and Faith Fich and Eric Ruppert : Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems,
  pages 260-274.
• Yitzhak Birk and Liran Liss and Assaf Schuster and Ran Wolff : A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion,
  pages 275-289.
• Neeraj Mittal and Sathya Peri and Subbarayan Venkatesan : Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies,
  pages 290-304.
• Ittai Abraham and Cyril Gavoille and Dahlia Malkhi : Routing with Improved Communication-Space Trade-Off,
  pages 305-319.
• Xiaozhou Li and Jayadev Misra and Greg Plaxton : Active and Concurrent Topology Maintenance,
  pages 320-334.
• Mirjam Wattenhofer and Roger Wattenhofer : Distributed Weighted Matching,
  pages 335-348.
• Lei Guo and Song Jiang, Li Xiao and Xiaodong Zhang : Fast and Low Cost P2P Searching by Exploiting Localities in Peer Community and Individual Peers,
  pages 349-364.
• Yon Dourisboure : Compact Routing Schemes for Tree-Length $\delta$ Graphs and for $k$-chordal Graphs,
  pages 365-378.
• Ueli Maurer : Torwards a Theory of Consistency Primitives,
  pages 379-389.
• Uri Nadav and Moni Naor : Fault-Tolerant Storage in a Dynamic Environment,
  pages 390-404.
• Rida Bazzi and Yin Ding : Non-Skipping Timestamps for Byzantine Data Storage Systems,
  pages 405-419.
• Rida Bazzi and Goran Konjevod : Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty,
  pages 420-434.
• Ehab Elmallah and Mohamed Gouda and Eunjin Jung : Optimal Dispersal of Certificate Chains,
  pages 435-449.
• Pandurangan Chandrashekaran and Ravikant D V S and Srinathan Kannan and Srikanth Venkateswaran and Muthuramakrishnan Venkitasubramaniam : On Byzantine Agreement over (2,3)-Uniform Hypergraphs,
  pages 450-.

Brief Announcement

• Gero Muehl and Andreas Tanner : A Formalisation of Message-Complete Publish/Subscribe Systems,
  pages -.
• Karthikeyan Bhargavan and Marc Shapiro : A formalism for consistency and partial replication,
  pages -.
• Sameh Elnikety and Fernando Pedone and Willy Zwaenepoel : Generalized Snapshot Isolation and a Prefix-Consistent Implementation,
  pages -.
• Islene C. Garcia and LuizE. Buzato and Fernando Pedone and Rodrigo Schmidt : Optimal Asynchronous Garbage Collection for Checkpointing Protocols with Rollback-Dependency Trackability,
  pages -.
• Hagit Attiya and Idan Zach : Efficient Fully Adaptive Snapshots using Incremental Calculation,
  pages -.
• Marcos Aguilera and Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg : Consensus with Byzantine Failures and Little System Synchrony,
  pages -.

Winner of Best Student Paper Award

• Hagit Attiya and Fabian Kuhn and Mirjam Wattenhofer and Roger Wattenhofer : Efficient Adaptive Collect using Randomization,
  pages 159-173.
• Laurent Fribourg and Stephane Messika and Claudine Picaronny : Coupling and Self-Stabilization,
  pages 201-214.