Abstract is missing.
- Solved Problems, Unsolved Problems and Non-Problems in Concurrency (Invited Address)Leslie Lamport. 1-11
- Verification of Multiprocess Probabilistic ProtocolsAmir Pnueli, Lenore D. Zuck. 12-27
- A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract)Shlomit S. Pinter, Pierre Wolper. 28-37
- A Technique for Proving Liveness of Communicating Finite State Machines with ExamplesMohamed G. Gouda, Chung-Kuo Chang. 38-49
- Knowledge, Common Knowledge and related puzzles (Extended Summary)Daniel J. Lehmann. 62-67
- Byzantine Clock SynchronizationLeslie Lamport, P. M. Melliar-Smith. 68-74
- A New Fault-Tolerant Algorithm for Clock SynchronizationJennifer Lundelius, Nancy A. Lynch. 75-88
- Fault-Tolerant Clock SynchronizationJoseph Y. Halpern, Barbara Simons, H. Raymond Strong, Danny Dolev. 89-102
- Consensus in the Presence of Partial Synchrony (Preliminary Version)Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer. 103-118
- Asynchronous Byzantine ConsensusChagit Attiya, Danny Dolev, Joseph Gil. 119-133
- Elections in the Presence of FaultsMichael Merritt. 134-142
- Patterns of Communication in Consensus ProtocolsCynthia Dwork, Dale Skeen. 143-153
- An Asynchronou [(n-1)/3]-Resilient Consensus ProtocolGabriel Bracha. 154-162
- Randomized Byzantine AgreementsSam Toueg. 163-178
- Relations Between Concurrent-Write Models of Parallel ComputationFaith E. Fich, Prabhakar Ragde, Avi Wigderson. 179-189
- Election and Traversal in Unidirectional NetworksEli Gafni, Yehuda Afek. 190-198
- Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of ProcessorsEphraim Korach, Shlomo Moran, Shmuel Zaks. 199-207
- SODA: A Simplified Operating System for Distributed ApplicationsJonathan Kepecs, Marvin H. Solomon. 208-219
- Replicated Procedure CallEric C. Cooper. 220-232
- Efficient Solutions to the Replicated Log and Dictionart ProblemsGene T. J. Wuu, Arthur J. Bernstein. 233-242
- An Approach to Performance Analysis of Timestamp-driven Synchronization MechanismsDavid Jefferson, Andrew Witkowski. 243-253
- Fail Termination of Communicating ProcesseOrna Grumberg, Nissim Francez, Shmuel Katz. 254-265
- Distributed Algorithms for Ensuring Fair Interprocess CommunicationsA. Prasad Sistla. 266-277
- Efficient and Reliable Broadcast is Achievable in an Eventually Connected NetworkBaruch Awerbuch, Shimon Even. 278-281
- A Distributed Algorithm for Deadlock Detection and ResolutionDon P. Mitchell, Michael Merritt. 282-284
- A Distributed Algorithm for Generalized Deadlock DetectionGabriel Bracha, Sam Toueg. 285-301