Journal: Distributed Computing

Volume 14, Issue 4

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

Volume 14, Issue 3

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

Volume 14, Issue 2

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

Volume 14, Issue 1

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