4. WDAG 1990: Bari, Italy

@proceedings{DBLP:conf/wdag/1990,
  editor    = {Jan van Leeuwen and
               Nicola Santoro},
  title     = {Distributed Algorithms, 4th International Workshop, WDAG '90,
               Bari, Italy, September 24-26, 1990, Proceedings},
  booktitle = {WDAG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {486},
  year      = {1991},
  isbn      = {3-540-54099-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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