Distributed Computing, Volume 9

Volume 9, Number 1, 1995

• Ishai Ben-Aroya, Tamar Eilam, Assaf Schuster:
  Greedy Hot-Potato Routing on the Two-Dimensional Mesh. 3-19
  
• Wim H. Hesselink:
  Wait-Free Linearization with a Mechanical Proof. 21-36
  
• Mustaque Ahamad, Gil Neiger, James E. Burns, Prince Kohli, Phillip W. Hutto:
  Causal Memory: Definitions, Implementation, and Programming. 37-49
  
• Jae-Heon Yang, James H. Anderson:
  A Fast, Scalable Mutual Exclusion Algorithm. 51-60
  

Volume 9, Number 2, 1995

• Ufuk Celikkan, Rance Cleaveland:
  Generating Diagnostic Information for Behavioral Preorders. 61-75
  
• Y. C. Tay, W. Tim Loke:
  On Deadlocks of Exclusive AND-Requests for Resources. 77-94
  
• Arkady Zamsky, Amos Israeli, Shlomit S. Pinter:
  Optimal Time Byzantine Agreement for t<n/8 With Linear-Messages. 95-108
  

Volume 9, Number 3, 1995

• Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
  Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery. 109-117
  
• Roy Friedman:
  Implementing Hybrid Consistency with High-Level Synchronization Operations. 119-129
  
• Li Gong:
  Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations. 131-145
  
• Hasan Md. Sayeed, Marwan Abu-Amara, Hosame Abu-Amara:
  Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links. 147-156
  

Volume 9, Number 4, 1996

• Jacob Brunekreef, Joost-Pieter Katoen, Ron Koymans, Sjouke Mauw:
  Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks. 157-171
  
• Bernadette Charron-Bost, Friedemann Mattern, Gerard Tel:
  Synchronous, Asynchronous, and Causally Ordered Communication. 173-191
  
• Maurice Herlihy, Nir Shavit, Orli Waarts:
  Linearizable Counting Networks. 193-203
  

Last update Fri May 24 20:15:10 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page