2. WDAG 1987: Amsterdam, The Netherlands

Jan van Leeuwen (Ed.): Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987, Proceedings. Lecture Notes in Computer Science 312 Springer 1988, ISBN 3-540-19366-9 BibTeX

@proceedings{DBLP:conf/wdag/1987,
  editor    = {Jan van Leeuwen},
  title     = {Distributed Algorithms, 2nd International Workshop, Amsterdam,
               The Netherlands, July 8-10, 1987, Proceedings},
  booktitle = {WDAG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {312},
  year      = {1988},
  isbn      = {3-540-19366-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1

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

Session 2

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

Session 3

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

Session 4

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

Session 5

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

Session 6

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