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

Session 1

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

Session 2

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

Session 3

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

Session 4

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

Session 5

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

Session 6

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

Last update Thu May 23 18:07:53 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page