7. PODC 1988: Toronto, Ontario, Canada

• Jim Gray:
  The Cost of Messages. 1-7
  
• Brian M. Oki, Barbara Liskov:
  Viewstamped Replication: A General Primary Copy. 8-17
  
• Allan D. Griefer, H. Raymond Strong:
  Fault Tolerant Distributed Services. 18-27
  
• Jennifer L. Welch, Leslie Lamport, Nancy A. Lynch:
  A Lattice-Structured Proof of a Minimum Spanning. 28-43
  
• Ching-Tsun Chou, Eli Gafni:
  Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. 44-65
  
• Amotz Bar-Noy, Joseph Naor, Moni Naor:
  One Bit Algorithms. 66-76
  
• Israel Cidon, Inder S. Gopal, Shay Kutten:
  New Models and Algorithms for Future Networks. 79-89
  
• Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung:
  The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. 90-104
  
• Eugene Styer, Gary L. Peterson:
  Improved Algorithms for Distributed Resource Allocation. 105-116
  
• Masafumi Yamashita, Tiko Kameda:
  Computing on an Anonymous Network. 117-130
  
• Eli Gafni, Yehuda Afek:
  End-to-End Communication in Unreliable Networks. 131-148
  
• Nancy A. Lynch, Yishay Mansour, Alan Fekete:
  Data Link Layer: Two Impossibility Results. 149-170
  
• David B. Johnson, Willy Zwaenepoel:
  Recovery in Distributed Systems Using Asynchronous Message Logging and Checkpointing. 171-181
  
• Ming-Deh A. Huang, Shang-Hua Teng:
  Secure and Verifiable Schemes for Election and General Distributed Computing Problems. 182-196
  
• Prakash Panangaden, Kim Taylor:
  Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems. 197-209
  
• Vijay A. Saraswat, Kenneth M. Kahn, David Weinbaum:
  Detecting Stable Properties of Networks in Concurrent Logic Programming Languages. 210-222
  
• Shai Ben-David:
  The Global Time Assumption and Semantics for Concurrent Systems. 223-231
  
• van Vicious Nguyen, Robert E. Strom:
  Process Semantics: Universal Axioms Compositional Rules, and Applications. 232-247
  
• Gil Neiger, Sam Toueg:
  Automatically Increasing the Fault-Tolerance of Distributed Systems. 248-262
  
• Ofer Biran, Shlomo Moran, Shmuel Zaks:
  A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. 263-275
  
• Maurice Herlihy:
  Impossibility and Universality Results for Wait-Free Synchronization. 276-290
  
• Karl R. Abrahamson:
  On Achieving Consensus Using a Shared Memory. 291-302