Archives
1985-2007

3th International Workshop on Distributed Algorithms

Nice, France, September 26-28, 1989

The proceedings of the conference is edited by
Jean-Claude Bermond and Michel Raynal
In: Lecture Notes in Computer Science Vol. 392, Springer, 1989,
ISBN 3-540-51687-5.

List of papers:

• Judit Bar-Ilan and Dror Zernik : Random Leaders and Random Spanning Trees,
  pages 1-12.
• Amotz Bar-Noy and Danny Dolev and Daphne Koller and David Peleg : Fault-Tolerant Critical Section Management in Asynchronous Networks,
  pages 13-23.
• Reuven Bar-Yehuda and Oded Goldreich and Alon Itai : Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection,
  pages 24-32.
• José M. Bernabéu-Aubán and Mustaque Ahamad : Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm,
  pages 33-44.
• Bernadette Charron-Bost : Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory,
  pages 45-56.
• Israel Cidon and Yoram Ofek : Distributed Fairness Algorithms for Local Area Networks,
  pages 57-69.
• Reuven Cohen and Adrian Segall : An Efficient Reliable Ring Protocol,
  pages 70-82.
• David Ginat and A. Udaya Shankar and Ashok A. Agrawala : An Efficient Solution to the Drinking Philosophers Problem and Its Extension,
  pages 83-93.
• Kenneth J. Goldman : Highly Concurrent Logically Synchronous Multicast,
  pages 94-109.
• Ajei S. Gopal and Sam Toueg : Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version),
  pages 110-123.
• Jean-Michel Hélary : Observing Global States of Asynchronous Distributed Applications,
  pages 124-135.
• Jean-Marc Jézéquel : Building a Global Time on Parallel Machines,
  pages 136-147.
• Evangelos Kranakis : Functional Dependencies of Variables in Wait-Free Programs (Extended Abstract),
  pages 148-159.
• Reinhard Lüling and Burkhard Monien : Two Strategies for Solving the Vertex Cover Problem on a Transputer Network,
  pages 160-170.
• Toshimitsu Masuzawa and Naoki Nishikawa and Kenichi Hagihara and Nobuki Tokura : Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction,
  pages 171-182.
• Yossi Matias and Yehuda Afek : Simple and Efficient Election Algorithms for Anonymous Networks,
  pages 183-194.
• Marta Rukoz : A Distributed Solution for Detecting Deadlock in Distributed Nested Transaction Systems,
  pages 195-206.
• Beverly A. Sanders and Philipp A. Heuberger : Distributed Deadlock Detection and Resolution with Probes,
  pages 207-218.
• André Schiper and Jorge Eggli and Alain Sandoz : A New Algorithm to Implement Causal Ordering,
  pages 219-232.
• Paul G. Spirakis and Basil Tampakas and Athanasios Tsiolis : Symmetry Breaking in Asynchronous Rings with O(n) Messages,
  pages 233-241.
• Frank A. Stomp and Willem P. de Roever : Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract),
  pages 242-253.
• Gadi Taubenfeld and Shlomo Moran : Possibility and Impossibility Results in a Shared Memory Environment,
  pages 254-267.
• Alfred Taudes : Communication Heuristics in Distributed Combinatorial Search Algorithms,
  pages 268-279.
• Kim Taylor : The Role of Inhibition on Asynchronous Consistent-Cut Protocols,
  pages 280-291.
• John Tromp : How to Construct an Atomic Variable (Extended Abstract),
  pages 292-302.
• M. Yamashita and Tiko Kameda : Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract),
  pages 303-314.