PODC A*

26 papers

YearTitle / Authors
1986A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols.
Brian A. Coan
1986Asymptotically Optimal Algorithms For Approximale Agreement.
Alan David Fekete
1986Continous Routing and Batch Routing on the Hypercube.
Yukon Chang, Janos Simon
1986Correctness Conditions for Highly Available Replicated Databases.
Nancy A. Lynch, Barbara T. Blaustein, Michael D. Siegel
1986Designing a Global Name Service.
Butler W. Lampson
1986Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract).
Josh Cohen Benaloh, Moti Yung
1986Efficient Synchronization on Multiprocessors with Shared Memory.
Clyde P. Kruskal, Larry Rudolph, Marc Snir
1986Gap Theorems for Distributed Computation.
Shlomo Moran, Manfred K. Warmuth
1986Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection.
Barbara Liskov, Rivka Ladin
1986Incremental Attribute Evaluation in Distributed Language-Based Environments.
Simon M. Kaplan, Gail E. Kaiser
1986Limitations on Database Availability when Networks Partition.
Brian A. Coan, Brian M. Oki, Elliot K. Kolodner
1986Memory Coherence in Shared Virtual Memory Systems.
Kai Li, Paul Hudak
1986On Fault Tolerant Routings in General Networks.
David Peleg, Barbara Simons
1986On the Bit Complexity of Distributed Computations in a Ring with a Leader.
Yishay Mansour, Shmuel Zaks
1986Optimal Message Routing without Complete Routing Tables (preliminary version).
Greg N. Frederickson, Ravi Janardan
1986Optimistic Concurrency Control for Abstract Data Types.
Maurice Herlihy
1986Probabilistic Solitude Verification on a Ring.
Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1986Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 11-13, 1986
Joseph Y. Halpern
1986Protocols for Dynamic Vote Reassignment.
Daniel Barbará, Hector Garcia-Molina, Annemarie Spauster
1986Reasoning About Networks With Many Identical Finite-State Processes.
Edmund M. Clarke, Orna Grumberg, Michael C. Browne
1986Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings.
Baruch Schieber, Shlomo Moran
1986The Complexity of Using Forwarding Addresses for Decentralized Object Finding.
Robert J. Fowler
1986The Effect of Link Failures on Computations in Asynchronous Rings.
Oded Goldreich, Liuba Shrira
1986The Synthesis of Communication Protocols.
Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
1986Transaction Commit in a Realistic Fault Model.
Brian A. Coan, Jennifer Lundelius
1986What Processes Know: Definitions and Proof Methods (Preliminary Version).
Shmuel Katz, Gadi Taubenfeld