Abstract is missing.
- Random Leaders and Random Spanning TreesJudit Bar-Ilan, Dror Zernik. 1-12
- Fault-Tolerant Critical Section Management in Asynchronous NetworksAmotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg. 13-23
- Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision DetectionReuven Bar-Yehuda, Oded Goldreich, Alon Itai. 24-32
- Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion AlgorithmJosé M. Bernabéu-Aubán, Mustaque Ahamad. 33-44
- Combinatorics and Geometry of Consistent Cuts: Application to Concurrency TheoryBernadette Charron-Bost. 45-56
- Distributed Fairness Algorithms for Local Area NetworksIsrael Cidon, Yoram Ofek. 57-69
- An Efficient Reliable Ring ProtocolReuven Cohen, Adrian Segall. 70-82
- An Efficient Solution to the Drinking Philosophers Problem and Its ExtensionDavid Ginat, A. Udaya Shankar, Ashok K. Agrawala. 83-93
- Highly Concurrent Logically Synchronous MulticastKenneth J. Goldman. 94-109
- Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version)Ajei S. Gopal, Sam Toueg. 110-123
- Observing Global States of Asynchronous Distributed ApplicationsJean-Michel Hélary. 124-135
- Building a Global Time on Parallel MachinesJean-Marc Jézéquel. 136-147
- Functional Dependencies of Variables in Wait-Free Programs (Extended Abstract)Evangelos Kranakis. 148-159
- Two Strategies for Solving the Vertex Cover Problem on a Transputer NetworkReinhard Lüling, Burkhard Monien. 160-170
- Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of DirectionToshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura. 171-182
- Simple and Efficient Election Algorithms for Anonymous NetworksYossi Matias, Yehuda Afek. 183-194
- A Distributed Solution for Detecting Deadlock in Distributed Nested Transaction SystemsMarta Rukoz. 195-206
- Distributed Deadlock Detection and Resolution with ProbesBeverly A. Sanders, Philipp A. Heuberger. 207-218
- A New Algorithm to Implement Causal OrderingAndré Schiper, Jorge Eggli, Alain Sandoz. 219-232
- Symmetry Breaking in Asynchronous Rings with O(n) MessagesPaul G. Spirakis, Basil Tampakas, Athanasios Tsiolis. 233-241
- Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)Frank A. Stomp, Willem P. de Roever. 242-253
- Possibility and Impossibility Results in a Shared Memory EnvironmentGadi Taubenfeld, Shlomo Moran. 254-267
- Communication Heuristics in Distributed Combinatorial Search AlgorithmsAlfred Taudes. 268-279
- The Role of Inhibition on Asynchronous Consistent-Cut ProtocolsKim Taylor. 280-291
- How to Construct an Atomic Variable (Extended Abstract)John Tromp. 292-302
- Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)Masafumi Yamashita, Tiko Kameda. 303-314