5. PODC 1986: Calgary, Alberta, Canada
Joseph Y. Halpern (Ed.): Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 11-13, 1986. ACM 1986 ISBN 0-89791-198-9- Butler W. Lampson: Designing a Global Name Service. 1-10
- Nancy A. Lynch, Barbara T. Blaustein, Michael Siegel: Correctness Conditions for Highly Available Replicated Databases. 11-28
- Barbara Liskov, Rivka Ladin: Highly-Available Distributed Service and Fault-Tolerant Distributed Garbage Collection. 29-39
- Josh Cohen Benaloh, Moti Yung: Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract). 52-62
- Brian A. Coan: A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols. 63-72
- Alan David Fekete: Asymptotically Optimal Algorithms For Approximale Agreement. 73-87
- Greg N. Frederickson, Ravi Janardan: Optimal Message Routing without Complete Routing Tables (preliminary version). 88-97
- Robert J. Fowler: The Complexity of Using Forwarding Addresses for Decentralized Object Finding. 108-120
- Simon M. Kaplan, Gail E. Kaiser: Incremental Attribute Evaluation in Distributed Language-Based Environments. 121-130
- Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. 151-160
- Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Solitude Verification on a Ring. 161-173
- Oded Goldreich, Liuba Shrira: The Effect of Link Failures on Computations in Asynchronous Rings. 174-185
- Brian A. Coan, Brian M. Oki, Elliot K. Kolodner: Limitations on Database Availability when Networks Partition. 187-194
- Daniel Barbará, Hector Garcia-Molina, Annemarie Spauster: Protocols for Dynamic Vote Reassignment. 195-205
- Maurice Herlihy: Optimistic Concurrency Control for Abstract Data Types. 206-217
- Clyde P. Kruskal, Larry Rudolph, Marc Snir: Efficient Synchronization on Multiprocessors with Shared Memory. 218-228
- Edmund M. Clarke, Orna Grumberg, Michael C. Browne: Reasoning About Networks With Many Identical Finite-State Processes. 240-248
- Shmuel Katz, Gadi Taubenfeld: What Processes Know: Definitions and Proof Methods (Preliminary Version). 249-262
- Foto N. Afrati, Christos H. Papadimitriou, Georgios I. Papadimitriou: The Synthesis of Communication Protocols. 263-271
- Baruch Schieber, Shlomo Moran: Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. 282-292
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team