Archives
1985-2009

5th International Workshop on Distributed Algorithms

Delphi, Greece, October 7-9, 1991

The proceedings of the conference is edited by
Sam Toueg and Paul G. Spirakis and Lefteris M. Kirousis
In: Lecture Notes in Computer Science Vol. 579, Springer, 1991,
ISBN 3-540-55236-7.

List of papers:

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