1. ATM layouts with bounded hop count and congestion

   • Michele Flammini
   • Enrico Nardelli
   • Guido Proietti

   Orignial articles Pages: 65 - 73

2. An algorithm for the asynchronous Write-All problem based on process collision

   • Jan Friso Groote
   • Wim H. Hesselink
   • Rogier Vermeulen

   Orignial articles Pages: 75 - 81

3. Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

   • J. Beauquier
   • B. Bérard
   • F. Magniette

   Orignial articles Pages: 83 - 95

4. Some simple distributed algorithms for sparse networks

   • Alessandro Panconesi
   • Romeo Rizzi

   Orignial articles Pages: 97 - 100

5. How to reconcile fault-tolerant interval intersection with the Lipschitz condition

   • Ulrich Schmid
   • Klaus Schossmaier

   Orignial articles Pages: 101 - 111

6. Implementing the CORBA GIOP in a high-performance object request broker environment

   • Geoff Coulson
   • Shakuntala Baichoo

   Orignial articles Pages: 113 - 126