Distributed Computing, Volume 10

Volume 10, Number 1, 1996

• Rajeev Alur, Gadi Taubenfeld: Fast Timing-Based Algorithms. 1-10
• Carol Critchlow, Kim Taylor: The Inhibition Spectrum and the Achievement of Causal Consistency. 11-27
• Christian Kant, Teruo Higashino, Gregor von Bochmann: Deriving Protocol Specifications from Service Specifications Written in LOTOS. 29-47
• Ariel Orda, Raphael Rom: Distributed Shortest-Path Protocols for Time-Dependent Networks. 49-62

Volume 10, Number 2, 1997

• Pierre Fraigniaud, Cyril Gavoille: Universal Routing Schemes. 65-78
• Umesh Maheshwari, Barbara Liskov: Collecting Cyclic Distributed Garbage by Controlled Migration. 79-86
• David Peleg, Avishai Wool: Crumbling Walls: A Class of Practical and Efficient Quorum Systems. 87-97
• Nir Shavit, Dan Touitou: Software Transactional Memory. 99-116

Volume 10, Number 3, 1997

• Rida A. Bazzi, Gil Neiger, Gary L. Peterson: On the Use of Registers in Achieving Wait-Free Consensus. 117-127
• Danilo Bruschi, Massimiliano Del Pinto: Lower Bounds for the Broadcast Problem in Mobile Radio Networks. 129-135
• Madhavan Mukund, Milind A. Sohoni: Keeping Track of the Latest Gossip in a Distributed System. 137-148
• André Schiper: Early Consensus in an Asynchronous System with a Weak Failure Detector. 149-157 , Erratum: Distributed Computing 10(4): 198 (1997)
• Gurdip Singh: Efficient Leader Election Using Sense of Direction. 159-165

Volume 10, Number 4, 1997

• Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju:
  A Self-Stabilizing Algorithm for the Maximum Flow Problem. 167-180
  
• Shing-Tsaan Huang, Lih-Chyau Wuu:
  Self-Stabilizing Token Circulation in Uniform Networks. 181-187
  
• Michael Mitzenmacher:
  Constant Time per Edge is Optimal on Rooted Tree Networks. 189-197
  

• Ronald Fagin, Joseph Y. Halpern, Yoram Moses, Moshe Y. Vardi:
  Knowledge-Based Programs. 199-225