default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd WDAG 1989: Nice, France
- Jean-Claude Bermond, Michel Raynal:
Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings. Lecture Notes in Computer Science 392, Springer 1989, ISBN 3-540-51687-5 - Judit Bar-Ilan, Dror Zernik:
Random Leaders and Random Spanning Trees. 1-12 - Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg:
Fault-Tolerant Critical Section Management in Asynchronous Networks. 13-23 - Reuven Bar-Yehuda, Oded Goldreich
, Alon Itai:
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. 24-32 - José M. Bernabéu-Aubán, Mustaque Ahamad:
Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm. 33-44 - Bernadette Charron-Bost:
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory. 45-56 - Israel Cidon, Yoram Ofek:
Distributed Fairness Algorithms for Local Area Networks. 57-69 - Reuven Cohen, Adrian Segall:
An Efficient Reliable Ring Protocol. 70-82 - David Ginat, A. Udaya Shankar, Ashok K. Agrawala:
An Efficient Solution to the Drinking Philosophers Problem and Its Extension. 83-93 - Kenneth J. Goldman:
Highly Concurrent Logically Synchronous Multicast. 94-109 - Ajei S. Gopal, Sam Toueg:
Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version). 110-123 - Jean-Michel Hélary:
Observing Global States of Asynchronous Distributed Applications. 124-135 - Jean-Marc Jézéquel:
Building a Global Time on Parallel Machines. 136-147 - Evangelos Kranakis:
Functional Dependencies of Variables in Wait-Free Programs (Extended Abstract). 148-159 - Reinhard Lüling, Burkhard Monien:
Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. 160-170 - Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura:
Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction. 171-182 - Yossi Matias, Yehuda Afek:
Simple and Efficient Election Algorithms for Anonymous Networks. 183-194 - Marta Rukoz:
A Distributed Solution for Detecting Deadlock in Distributed Nested Transaction Systems. 195-206 - Beverly A. Sanders, Philipp A. Heuberger:
Distributed Deadlock Detection and Resolution with Probes. 207-218 - André Schiper, Jorge Eggli, Alain Sandoz:
A New Algorithm to Implement Causal Ordering. 219-232 - Paul G. Spirakis, Basil Tampakas, Athanasios Tsiolis:
Symmetry Breaking in Asynchronous Rings with O(n) Messages. 233-241 - Frank A. Stomp, Willem P. de Roever:
Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract). 242-253 - Gadi Taubenfeld, Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment. 254-267 - Alfred Taudes:
Communication Heuristics in Distributed Combinatorial Search Algorithms. 268-279 - Kim Taylor:
The Role of Inhibition on Asynchronous Consistent-Cut Protocols. 280-291 - John Tromp:
How to Construct an Atomic Variable (Extended Abstract). 292-302 - Masafumi Yamashita, Tiko Kameda:
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). 303-314
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 2026-06-09 22:38 CEST 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:
