Archives
1985-2009

13th International Symposium on Distributed Computing

Bratislava, Slovak Republic, September 27-29, 1999

The proceedings of the conference is edited by
Prasad Jayanti
In: Lecture Notes in Computer Science Vol. 1693, Springer, 1999,
ISBN 3-540-66531-5.

List of papers:

Invited Lecture

• Guruduth Banavar and Tushar Deepak Chandra and Robert E. Strom and Daniel C. Sturman : A Case for Message Oriented Middleware,
  pages 1-18.

Regular Papers

• Marcos Kawazoe Aguilera and Sam Toueg and Borislav Deianov : Revising the Weakest Failure Detector for Uniform Reliable Broadcast,
  pages 19-33.
• Mikel Larrea and Sergio Arévalo and Antonio Fernández : Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems,
  pages 34-48.
• Achour Mostéfaoui and Michel Raynal : Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach,
  pages 49-63.
• Roberto De Prisco and Alan Fekete and Nancy A. Lynch and Alexander A. Shvartsman : A Dynamic Primary Configuration Group Communication Service,
  pages 64-78.
• Kal Lin and Vassos Hadzilacos : Asynchronous Group Membership with Oracles,
  pages 79-93.
• Fernando Pedone and André Schiper : Generic Broadcast,
  pages 94-108.
• Rida A. Bazzi : Non-blocking Asynchronous Byzantine Quorum Systems,
  pages 109-122.
• Bernd Altmann and Matthias Fitzi and Ueli M. Maurer : Byzantine Agreement Secure against General Adversaries in the Dual Failure Model,
  pages 123-137.
• Carlo Blundo and Clemente Galdi and Pino Persiano : Randomness Recycling in Constant-Round Private Computations (extended Abstract),
  pages 138-150.
• Juan A. Garay and Philip D. MacKenzie : Abuse-Free Multi-party Contract Signing,
  pages 151-165.
• K. Alagarsamy and K. Vidyasankar : Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract),
  pages 166-179.
• James H. Anderson and Yong-Jik Kim : Fast and Scalable Mutual Exclusion,
  pages 180-194.
• Yuh-Jzer Joung : The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract),
  pages 195-209.
• Ashis Tarafdar and Vijay K. Garg : Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution,
  pages 210-224.
• Camelia Zlatea and Tzilla Elrad : DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Orders Semantics,
  pages 225-239.
• Joffroy Beauquier and Béatrice Bérard and Laurent Fribourg : A New Rewrite Method for Convergence of Self-Stabilizing Systems,
  pages 240-253.
• Mikhail Nesterenko and Anish Arora : Stabilization-Preserving Atomicity Refinement,
  pages 254-268.
• Matthew K. Franklin and Juan A. Garay and Moti Yung : Self-Testing/Correcting Protocols (Extended Abstract),
  pages 269-283.
• Bogdan S. Chlebus and Darius R. Kowalski : Randomization Helps to Perform Tasks on Processors Prone to Failures,
  pages 284-296.
• Panagiota Fatourou and Paul G. Spirakis : A New Scheduling Algorithm for General Strict Multithreaded Computations,
  pages 297-311.
• Eric Ruppert : Consensus Numbers of Transactional Objects,
  pages 312-326.
• Maria Eleftheriou and Marios Mavronicolas : Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions,
  pages 327-341.
• Shay Kutten and Avner Porat : Maintenance of a Spanning Tree in Dynamic Networks,
  pages 342-355.

Winner of Best Student Paper Award

• Marcos Kawazoe Aguilera and Sam Toueg and Borislav Deianov : Revising the Weakest Failure Detector for Uniform Reliable Broadcast,
  pages 19-33.