Archives
1985-2007

4th International Workshop on Distributed Algorithms

Bari, Italy, September 24-26, 1990

The proceedings of the conference is edited by
Jan van Leeuwen and Nicola Santoro
In: Lecture Notes in Computer Science Vol. 484, Springer, 1990,
ISBN 3-540-54099-7.

List of papers:

• Amos Israeli and Marc Jalfon : Self-Stabilizing Ring Orientation,
  pages 1-14.
• Yehuda Afek and Shay Kutten and Moti Yung : Memory-Efficient Self Stabilizing Protocols for General Networks,
  pages 15-28.
• Alon Atai : On the Computational Power Needed to Elect a Leader (Extended Abstract),
  pages 29-40.
• Ivan Lavellée and Christian Lavault : Spanning Tree Construction for Nameless Networks,
  pages 41-56.
• Joffroy Beauquier and Paul Gastin and Vincent Villain : A Linear Fault-Tolerant Naming Algorithm,
  pages 57-70.
• David Peleg : Distributed Data Structures: A Complexity-Oriented View,
  pages 71-89.
• Berthold Kröger and Reinhard Lüling and Burkhard Monien and Oliver Vornberger : An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems,
  pages 90-101.
• Sergio Rajsbaum and Moshe Sidi : On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version),
  pages 102-121.
• Jungho Park and Toshimitsu Masuzawa and Kenichi Hagihara and Nobuki Tokura : Distributed Algorithms for Reconstructing MST after Topology Change,
  pages 122-132.
• Ravi Janardan and Siu-Wing Cheng : Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks,
  pages 133-150.
• Peter Grønning and Thomas Qvist Nielsen and Hans Henrik Løvengreen : Stepwise Development of a Distributed Load Balancing Algorithms,
  pages 151-168.
• Israel Cidon and Shay Kutten and Yishay Mansour and David Peleg : Greedy Packet Scheduling,
  pages 169-184.
• Israel Cidon and Inder Gopal and Shay Kutten : Optimal Computation of Global Sensitive Functions in Fast Networks,
  pages 185-191.
• Yoram Ofek and Moti Yung : Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks,
  pages 192-212.
• Cynthia Dwork : Strong Verifiable Secret Sharing (Extended Abstract),
  pages 213-227.
• Alain Sandoz and André Schiper : Weak Consistency and Pessimistic Replica Control,
  pages 228-244.
• Divyakant Agrawal and Amr El Abbadi : Localized-Access Protocols for Replicated Databases,
  pages 245-262.
• Mirjana Obradovic and Piotr Berman : Weighted Voting for Operation Dependent Management of Replicated Data,
  pages 263-276.
• Prasad Jayanti and Sam Toueg : Wakeup under Read/Write Atomicity,
  pages 277-288.
• Tushar Deepak Chandra and Sam Toueg : Time and Message Efficient Reliable Broadcasts,
  pages 289-303.
• Navin Budhiraja and Ajei S. Gopal and Sam Toueg : Early-Stopping Distributed Bidding and Applications (Preliminary Version),
  pages 304-320.
• Piotr Berman and Juan A. Garay : Fast Consensus in Networks of Bounded Degree (Extended Abstract),
  pages 321-333.
• Gil Neiger and Mark R. Tuttle : Common Knowledge and Consistent Simultaneous Coordination,
  pages 334-352.
• Rogério de Lemos and Paul D. Ezhilchelvan : Agreement on the Group Membership in Synchronous Distributed Systems,
  pages 353-372.
• Ofer Biran and Shlomo Moran and Shmuel Zaks : Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks,
  pages 373-389.
• Rudolf Fleischer and Hermann Jung and Kurt Mehlhorn : A Time-Randomness Tradeoff for Communication Complexity,
  pages 390-401.
• Soma Chaudhuri and Jennifer L. Welch : Bounds on the Costs of Register Implementations,
  pages 402-421.
• Yehuda Afek and Danny Dolev and Eli Gafni : A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem,
  pages 422-431.