3. PODC 1984:
Vancouver, B. C., Canada
Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro (Eds.):
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984.
ACM 1984, ISBN 0-89791-143-1 
- Leslie Lamport:
Solved Problems, Unsolved Problems and Non-Problems in Concurrency (Invited Address).
1-11
- Amir Pnueli, Lenore D. Zuck:
Verification of Multiprocess Probabilistic Protocols.
12-27
- Shlomit S. Pinter, Pierre Wolper:
A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract).
28-37
- Mohamed G. Gouda, Chung-Kuo Chang:
A Technique for Proving Liveness of Communicating Finite State Machines with Examples.
38-49
- Joseph Y. Halpern, Yoram Moses:
Knowledge and Common Knowledge in a Distributed Environment.
50-61
- Daniel J. Lehmann:
Knowledge, Common Knowledge and related puzzles (Extended Summary).
62-67
- Leslie Lamport, P. M. Melliar-Smith:
Byzantine Clock Synchronization.
68-74
- Jennifer Lundelius, Nancy A. Lynch:
A New Fault-Tolerant Algorithm for Clock Synchronization.
75-88
- Joseph Y. Halpern, Barbara Simons, H. Raymond Strong, Danny Dolev:
Fault-Tolerant Clock Synchronization.
89-102
- Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the Presence of Partial Synchrony (Preliminary Version).
103-118
- Chagit Attiya, Danny Dolev, Joseph Gil:
Asynchronous Byzantine Consensus.
119-133
- Michael Merritt:
Elections in the Presence of Faults.
134-142
- Cynthia Dwork, Dale Skeen:
Patterns of Communication in Consensus Protocols.
143-153
- Gabriel Bracha:
An Asynchronou [(n-1)/3]-Resilient Consensus Protocol.
154-162
- Sam Toueg:
Randomized Byzantine Agreements.
163-178
- Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Relations Between Concurrent-Write Models of Parallel Computation.
179-189
- Eli Gafni, Yehuda Afek:
Election and Traversal in Unidirectional Networks.
190-198
- Ephraim Korach, Shlomo Moran, Shmuel Zaks:
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors.
199-207
- Jonathan Kepecs, Marvin H. Solomon:
SODA: A Simplified Operating System for Distributed Applications.
208-219
- Eric C. Cooper:
Replicated Procedure Call.
220-232
- Gene T. J. Wuu, Arthur J. Bernstein:
Efficient Solutions to the Replicated Log and Dictionart Problems.
233-242
- David Jefferson, Andrew Witkowski:
An Approach to Performance Analysis of Timestamp-driven Synchronization Mechanisms.
243-253
- Orna Grumberg, Nissim Francez, Shmuel Katz:
Fail Termination of Communicating Processe.
254-265
- A. Prasad Sistla:
Distributed Algorithms for Ensuring Fair Interprocess Communications.
266-277
- Baruch Awerbuch, Shimon Even:
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.
278-281
- Don P. Mitchell, Michael Merritt:
A Distributed Algorithm for Deadlock Detection and Resolution.
282-284
- Gabriel Bracha, Sam Toueg:
A Distributed Algorithm for Generalized Deadlock Detection.
285-301
Last update Sat May 18 19:35:11 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
