Archives
1985-2007

2nd International Workshop on Distributed Algorithms

Amsterdam, The Netherlands, July 8-10, 1987

The proceedings of the conference is edited by
Jan van Leeuwen
In: Lecture Notes in Computer Science Vol. 312, Springer, 1987,
ISBN 3-540-19366-9.

List of papers:

Session 1

• Karl Erik Johansen and Ulla Lundin Jørgensen and Svend Hauge Nielsen : A Distributed Spanning Tree Algorithm,
  pages 1-12.
• Gerard Tel : Directed Network Protocols,
  pages 13-29.
• Alan E. Baratz and Inder Gopal and Adrian Segall : Fault Tolerant Queries in Computer Networks,
  pages 30-40.
• Jean-Claude Bermond and Jean-Claude König and Michel Raynal : General and Efficient Decentralized Consensus Protocols,
  pages 41-56.
• Kenneth J. Perry : A Framework for Agreement,
  pages 57-75.
• Edward T. Ordman : Byzantine Firing Squad Using a Faulty External Source,
  pages 76-83.

Session 2

• Walter Vogler : An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks,
  pages 84-91.
• Gurdip Singh and Scott A. Smolka and I. V. Ramakrishnan : Distributed Algorithms for Tree Pattern Matching,
  pages 92-107.
• Alberto Negro and Nicola Santoro and Jorge Urrutia : On the Packet Complexity of Distributed Selection,
  pages 108-115.
• Oliver Vornberger : Load Balancing in a Network of Transputers,
  pages 116-126.

Session 3

• Friedemann Mattern : Experience with a New Distributed Termination Detection Algorithm,
  pages 127-143.
• Ferenc Belik : A Distributed Deadlock Avoidance Technique,
  pages 144-154.
• Mohamed Naimi and Michel Trehel : How to Detect a Failure and Regenerate the Token in the Log(N) Distributed Algorithm for Mutual Exclusion,
  pages 155-166.
• Anneke A. Schoone : Verification of Connection-Management Protocols,
  pages 167-186.
• Eli Gafni : Generalized Scheme for Topology-Update in Dynamic Networks,
  pages 187-196.
• Yehuda Afek and Baruch Awerbuch and Eli Gafni : Local Fail-safe Network Reset Procedure,
  pages 197-211.

Session 4

• Ching-Tsun Chou and Israel Cidon and Inder Gopal and Shmuel Zaks : Synchronizing Aysnchronous Bounded Delay Networks,
  pages 212-218.
• Alan Fekete and Nancy A. Lynch and Liuba Shrira : A Modular Proof of Correctness for a Network Synchronizer (Research Summary),
  pages 219-256.
• K. B. Lakshmanan and K. Thulasiraman : On the Use of Synchronizers for Asynchronous Communication Networks,
  pages 257-277.
• Lefteris M. Kirousis and Evangelos Kranakis and Paul M. B. Vitányi : Atomic Multireader Register,
  pages 278-296.
• K. Vidyasankar and Toshimi Minoura : An Optimistic Resiliency Control Scheme for Distributed Database Systems,
  pages 297-309.
• R. Kerboul and R. Kung and F. Richard : A Failsafe Scheme for Replicated Information,
  pages 310-323.

Session 5

• Karl R. Abrahamson and Andrew Adler and Lisa Higham and David G. Kirkpatrick : Randomized Function on a Ring (Preliminary Version),
  pages 324-331.
• Violet R. Syrotiuk and Jan K. Pachl : A Distributed Ring Orientation Algorithm (Preliminary Version),
  pages 332-336.
• Hagit Attiya : Constructing Efficient Election Algorithms from Efficient Traversal Algorithms,
  pages 337-344.
• M. Y. Chan and F. Y. L. Chin : Optimal Resilient Ring Election Algorithms,
  pages 345-354.
• Hosame Abu-Amara : Fault-Tolerant Distributed Algorithms for Election in Complete Networks,
  pages 355-373.
• Rüdiger Reischuk and Meinolf Koshors : Lower Bounds for Synchronous Networks and the Advantage of Local Information,
  pages 374-387.

Session 6

• Luc Bougé : On the Existence of Generic Broadcast Algorithms in Networks of Communicating Sequential Processes (Extended Abstract),
  pages 388-407.
• Kaisa Sere : Stepwise Removal of Virtual Channels in Distributed Algorithms,
  pages 408-428.