14. PODC 1995: Ottawa, Ontario, Canada
James H. Anderson (Ed.): Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 20-23, 1995. ACM 1995 ISBN 0-89791-710-3
Invited Lectures at 1994 PODC
Jonathan S. Turner: Issues in Distributed Control for ATM Networks. 2-16
David A. Patterson, David E. Culler, Thomas E. Anderson: A Case for NOW (Networks of Workstations) - Abstract. 17
Log Presentations
Session L1

Ramakrishna Thurimella: Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract). 28-37
Rafail Ostrovsky, Daniel Shawcross Wilkerson: Faster Computation On Directed Networks of Automata (Extended Abstract). 38-46
Ravi Prakash, Niranjan G. Shivaratri, Mukesh Singhal: Distributed Dynamic Channel Allocation for Mobile Computing. 47-56
Session L2
Umesh Maheshwari, Barbara Liskov: Collecting Cyclic Distributed Garbage Using Heuristics to Control Migration. 57-63
E. N. Elnozahy: On the Relevance of Communication Costs of Rollback-Recovery Protocols. 74-79
Robbert van Renesse, Kenneth P. Birman, Roy Friedman, Mark Hayden, David A. Karr: A Framework for Protocol Composition in Horus. 80-89
Session L3

Gil Neiger: Failure Detectors and the Wait-Free Hierarchy. 100-109
Wai-Kau Lo: More on t-Resilience vs. Wait-Freedom (Extended Abstract). 110-119
Session L4
David Peleg, Avishai Wool: Crumbling Walls: A Class of Practical and Efficient Quorum Systems (Extended Abstract). 120-129
Rosario Gennaro: Achieving Independence Efficiently and Securely. 130-136
Christof Fetzer, Flaviu Cristian: Lower Bounds for Convergence Function Based Clock Synchronization. 137-143
Session L5
Nalini Venkatasubramanian, Carolyn L. Talcott: Reasoning about Meta Level Activities in Open Distributed Systems. 144-152
Crispin Cowan, Hanan Lutfiyya: Formal Semantics for Expressing Optimism: The Meaning of HOPE. 164-173
Anna Pogosyants, Roberto Segala: Formal Verification of Timed Properties for Randomized Distributed Algorithms. 174-183
Session L6



John D. Valois: Lock-Free Linked Lists Using Compare-and-Swap. 214-222
Session L7

Michalis Faloutsos, Mart Molle: Optimal Distributed Algorithm for Minimum Spanning Trees Revisited. 231-237
Shay Kutten, David Peleg: Fast Distributed Construction of k-Dominating Sets and Applications. 238-249
Brief Announcements
Session B1
James Aspnes, Orli Waarts: A Modular Measure of Competitiveness for Distributed Algorithms (Abstract). 252
Vaggelis Kapoulas, Paul G. Spirakis: Randomized Competitive Algorithms for Admission Control in General Networks (Abstract). 253
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-Space Polynomial End-to-End Communication (Abstract). 254
Shlomi Dolev, Ted Herman: SuperStabilizing Protocols for Dynamic Distributed Systems (Abstract). 255
Shlomi Dolev, Jennifer L. Welch: Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults (Abstract). 256


Tim Kindberg: A Sequencing Service for Group Communication (Abstract). 260
Session B2
Mehrdad Samadani, Erich Kaltofen: Prediction Based Task Scheduling in Distributed Computing (Abstract). 261
Lorenzo Alvisi, Keith Marzullo: Deriving Optimal Checkpoint Protocols for Distributed Shared Memory Architectures (Abstract). 263
Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi: Active Client Primary-Backup Protocols (Abstract). 264
Evaggelia Pitoura, Aidong Zhang, Bharat K. Bhargava: A View-Based Approach to Relaxing Global Serializability in a Multidatabase System (Abstract). 265
Gurdip Singh: Constraint-based Structuring of Distributed Protocols (Abstract). 266
Hans van der Schoot, Hasan Ural: Generalizing Fair Reachability Analysis to Protocols with Arbitrary Topology (Abstract). 267
Gordon V. Cormack: A Calculus for Concurrent Update (Abstract). 269
Session B3
Martha J. Kosa: Lazy-Writer Multivalued Registers (Abstract). 270
James H. Anderson, Srikanth Ramamurthy: Using Lock-Free Objects in Hard Real-Time Applications (Abstract). 272
Jerry James, Ambuj K. Singh: Complete Implementations for Shared Memory Consistency Conditions (Abstract). 273




