13. DISC 1999: Bratislava, Slavak Republic

Invited Lecture

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

Regular Papers

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