4. PODC 1985: Minaki, Ontario, Canada

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

Last update Thu May 23 17:50:24 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page