5. WDAG 1991: Delphi, Greece

• Uri Abraham, Shai Ben-David, Shlomo Moran:
  On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract). 1-8
  
• Mustaque Ahamad, James E. Burns, Phillip W. Hutto, Gil Neiger:
  Causal Memory. 9-30
  
• Efthymios Anagnostou, Ran El-Yaniv:
  More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms (Preliminary Report). 31-51
  
• James H. Anderson, Bojan Groselj:
  Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract). 52-70
  
• Anish Arora, Shlomi Dolev, Mohamed G. Gouda:
  Maintaining Digital Clocks In Step. 71-79
  
• Hagit Attiya:
  Implementing FIFO Queus and Stacks (Extended Abstract). 80-94
  
• Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
  Optimal Amortized Distributed Consensus (Extended Abstract). 95-107
  
• Rida A. Bazzi, Gil Neiger:
  Optimally Simulating Crash Failures in a Byzantine Environment. 108-128
  
• Piotr Berman, Juan A. Garay:
  Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). 129-142
  
• Gabriel Bracha, Ophir Rachman:
  Randomized Consensus in Expected O(n²log n) Operations. 143-150
  
• Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
  Using Adaptive Timeouts to Achive At-Most-Once Message Delivery. 151-166
  
• Shlomi Dolev, Amos Israeli, Shlomo Moran:
  Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact). 167-180
  
• Yung-Chen Hung, Gen-Huey Chen:
  The Quickest Path Problem in Distributed Computing Systems. 181-192
  
• Alon Itai:
  The Communication Complexity of the Two List Problem. 193-199
  
• Giuseppe F. Italiano:
  Distributed Algorithms for Updating Shortest Paths (Extended Abstract). 200-211
  
• Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd:
  Minimal Shared Information for Concurrent Reading and Writing. 212-228
  
• Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
  Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. 229-241
  
• Yossi Malka, Sergio Rajsbaum:
  Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version). 242-253
  
• Keith Marzullo, Gil Neiger:
  Detection of Global State Predicates. 254-272
  
• Keith Marzullo, Laura S. Sabel:
  Using Consistent Subcuts for Detecting Stable Properties. 273-288
  
• Michael Merritt, Gadi Taubenfeld:
  Atomic m-Register Operations (Extended Abstract). 289-294
  
• Sampath Rangarajan, Satish K. Tripathi:
  A Robust Distributed Mutual Exclusion Algorithm. 295-308
  
• Lior Shabtay, Adrian Segall:
  Message Delaying Synchronizers. 309-318