Distributed Computing, Volume 14

Volume 14, Number 1, 2001

• Francis C. Chu, Joseph Y. Halpern:
  A decision-theoretic approach to reliable message delivery. 1-16
  Electronic Edition (Springer LINK) BibTeX
• James H. Anderson, Yong-Jik Kim:
  A new fast-path mechanism for mutual exclusion. 17-29
  Electronic Edition (Springer LINK) BibTeX
• Wim H. Hesselink, Jan Friso Groote:
  Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). 31-39
  Electronic Edition (Springer LINK) BibTeX
• Rida A. Bazzi:
  Access cost for asynchronous Byzantine quorum systems. 41-48
  Electronic Edition (Springer LINK) BibTeX
• Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman:
  Performing tasks on synchronous restartable message-passing processors. 49-64
  Electronic Edition (Springer LINK) BibTeX

Volume 14, Number 2, 2001

• Michele Flammini, Enrico Nardelli, Guido Proietti:
  ATM layouts with bounded hop count and congestion. 65-73
  Electronic Edition (Springer LINK) BibTeX
• Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen:
  An algorithm for the asynchronous Write-All problem based on process collision. 75-81
  Electronic Edition (Springer LINK) BibTeX
• Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg, Frédéric Magniette:
  Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. 83-95
  Electronic Edition (Springer LINK) BibTeX
• Alessandro Panconesi, Romeo Rizzi:
  Some simple distributed algorithms for sparse networks. 97-100
  Electronic Edition (Springer LINK) BibTeX
• Ulrich Schmid, Klaus Schossmaier:
  How to reconcile fault-tolerant interval intersection with the Lipschitz condition. 101-111
  Electronic Edition (Springer LINK) BibTeX
• Geoff Coulson, Shakuntala Baichoo:
  Implementing the CORBA GIOP in a high-performance object request broker environment. 113-126
  Electronic Edition (Springer LINK) BibTeX

Volume 14, Number 3, 2001

• Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum:
  The BG distributed simulation algorithm. 127-146
  Electronic Edition (Springer LINK) BibTeX
• Bertrand Ducourthial, Sébastien Tixeuil:
  Self-stabilization with r-operators. 147-162
  Electronic Edition (Springer LINK) BibTeX
• Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
  Assigning labels in an unknown anonymous network with a leader. 163-183
  Electronic Edition (Springer LINK) BibTeX
• Evangelos Kranakis, Nicola Santoro:
  Distributed computing on oriented anonymous hypercubes with faulty components. 185-189
  Electronic Edition (Springer LINK) BibTeX

Volume 14, Number 4, 2001

• James H. Anderson:
  Introduction. 191
  Electronic Edition (Springer LINK) BibTeX
• Mark Moir:
  Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. 193-204
  Electronic Edition (Springer LINK) BibTeX
• Yehuda Hassin, David Peleg:
  Sparse communication networks and efficient routing in the plane. 205-215
  Electronic Edition (Springer LINK) BibTeX
• Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
  Interval routing schemes allow broadcasting with linear message-complexity. 217-229
  Electronic Edition (Springer LINK) BibTeX
• Svend Frølund, Rachid Guerraoui:
  X-Ability: a theory of replication. 231-249
  Electronic Edition (Springer LINK) BibTeX