default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 14
Volume 14, Number 1, 2001
- Francis C. Chu, Joseph Y. Halpern:
A decision-theoretic approach to reliable message delivery. 1-16 - James H. Anderson, Yong-Jik Kim:
A new fast-path mechanism for mutual exclusion. 17-29 - Wim H. Hesselink, Jan Friso Groote
:
Wait-free concurrent memory management by Create and Read until Deletion (CaRuD). 31-39 - Rida A. Bazzi:
Access cost for asynchronous Byzantine quorum systems. 41-48 - Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman:
Performing tasks on synchronous restartable message-passing processors. 49-64
Volume 14, Number 2, 2001
- Michele Flammini, Enrico Nardelli, Guido Proietti:
ATM layouts with bounded hop count and congestion. 65-73 - Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen:
An algorithm for the asynchronous Write-All problem based on process collision. 75-81 - 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 - Alessandro Panconesi, Romeo Rizzi:
Some simple distributed algorithms for sparse networks. 97-100 - Ulrich Schmid, Klaus Schossmaier:
How to reconcile fault-tolerant interval intersection with the Lipschitz condition. 101-111 - Geoff Coulson, Shakuntala Baichoo:
Implementing the CORBA GIOP in a high-performance object request broker environment. 113-126
Volume 14, Number 3, 2001
- Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum:
The BG distributed simulation algorithm. 127-146 - Bertrand Ducourthial, Sébastien Tixeuil:
Self-stabilization with r-operators. 147-162 - Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader. 163-183 - Evangelos Kranakis, Nicola Santoro:
Distributed computing on oriented anonymous hypercubes with faulty components. 185-189
Volume 14, Number 4, 2001
- James H. Anderson:
Introduction. 191 - Mark Moir:
Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. 193-204 - Yehuda Hassin, David Peleg:
Sparse communication networks and efficient routing in the plane. 205-215 - Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity. 217-229 - Svend Frølund, Rachid Guerraoui:
X-Ability: a theory of replication. 231-249
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
