4. PODC 1985: Minaki, Ontario, Canada

Proceedings of the Fourth Annual ACM Symposium on Princiles of Distributed Computing, August 5-7, 1985 Minaki, Ontario, Canada. ACM ISBN 0-89791-167-9

K. Mani Chandy: Concurrent Programming For The Masses (PODC 1984 Invited Address). 1-12 BibTeX
Ralph E. Johnson, Fred B. Schneider: Symmetry and Similarity in Distributed Systems. 13-22 BibTeX
Paris C. Kanellakis, Scott A. Smolka: On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. 23-38 BibTeX
A. Prasad Sistla: On Characterization of Safety and Liveness Properties in Temporal Logic. 39-48 BibTeX
Bengt Jonsson: A Model and Proof System for Asynchronous Networks. 49-58 BibTeX
Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. 59-70 BibTeX
T. K. Srikanth, Sam Toueg: Optimal Clock Synchronization. 71-86 BibTeX
Sam Toueg, Kenneth J. Perry, T. K. Srikanth: Fast Distributed Agreement (Preliminary Version). 87-101 BibTeX
Maurice Herlihy: Comparing How Atomicity Mechanisms Support Replication. 102-110 BibTeX
David Wai-Lok Cheung, Tiko Kameda: Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. 111-121 BibTeX
William E. Weihl: Distributed Version Management for Read-Only Actions (Extended Abstract). 122-135 BibTeX
Andrei Z. Broder: A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem (Extended Abstract). 136-148 BibTeX
Michael Ben-Or: Fast Asynchronous Byzantine Agreement (Extended Abstract). 149-151 BibTeX
Benny Chor, Michael Merritt, David B. Shmoys: Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). 152-162 BibTeX
Ephraim Korach, Shay Kutten, Shlomo Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. 163-174 BibTeX
Eli Gafni: Improvements in the Time Complexity of Two Message-Optimal Election Algorithms. 175-185 BibTeX
Yehuda Afek, Eli Gafni: Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. 186-195 BibTeX
Chagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an Anonymous Ring. 196-203 BibTeX
K. Mani Chandy, Jayadev Misra: How Processes Learn. 204-214 BibTeX
Yoram Moses, Danny Dolev, Joseph Y. Halpern: Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication (Preliminary Version). 215-223 BibTeX
Joseph Y. Halpern, Ronald Fagin: A Formal Model of Knowledge, Action, and Communication in Distributed Systems: Preliminary Report. 224-236 BibTeX
Stephen R. Mahaney, Fred B. Schneider: Inexact Agreement: Accuracy, Precision, and Graceful Degradation. 237-249 BibTeX
Keith A. Lantz, Judy L. Edighoffer, Bruce L. Hitson: Towards a Universal Directory Service. 250-260 BibTeX
Sape J. Mullender, Paul M. B. Vitányi: Distributed Match-Making for Processes in Computer Networks (Preliminary Version). 261-271 BibTeX
Baruch Awerbuch: Communication-Time Trade-Offs in Network Synchronization. 272-276 BibTeX
Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. 277-286 BibTeX
Boleslaw K. Szymanski, Yuan Shi, Noah S. Prywes: Terminating Iterative Solution of Simultaneous Equations in Distributed Message Passing Systems. 287-292 BibTeX
Alon Itai: Parallel Arithmetic with Concurrent Writes. 293-299 BibTeX
Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko: Simple, Efficient Asynchronous Parallel Algorithms for Maximization. 300-308 BibTeX
Amotz Bar-Noy, Michael Ben-Or, Danny Dolev: Choice Coordination with Bounded Failure (a Preliminary Version). 309-316 BibTeX