![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
2nd PODC 1983: Montreal, Quebec, Canada
- Robert L. Probert, Nancy A. Lynch, Nicola Santoro:
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17-19, 1983. ACM 1983, ISBN 0-89791-110-5
Session 1
- Cynthia Dwork, Dale Skeen:
The Inherent Cost of Nonblocking Commitment. 1-11 - Gabriel Bracha, Sam Toueg:
Resilient Consensus Protocols. 12-26 - Michael Ben-Or:
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). 27-30
Session 2
- James E. Allchin, Martin S. McKendry:
Synchronization and Recovery of Actions. 31-44 - Catriel Beeri, Philip A. Bernstein, Nathan Goodman:
A Concurrency Control Theory for Nested Transactions. 45-62 - William E. Weihl:
Data-dependent Concurrency Control and Recovery (Extended Abstract). 63-75 - C. Mohan, Bruce G. Lindsay:
Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions. 76-88 - C. Mohan, H. Raymond Strong, Sheldon J. Finkelstein:
Method for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors. 89-103 - Dean S. Daniels, Alfred Z. Spector:
An Algorithm for Replicated Directories. 104-113 - Philip A. Bernstein, Nathan Goodman:
The Failure and Recovery Problem for Replicated Databases. 114-122
Session 3
- Abha Moitra:
Synthesis of Communicating Processes. 123-130 - Ralph-Johan Back, Reino Kurki-Suonio:
Decentralization of Process Nets with Centralized Control. 131-142 - Liuba Shrira, Nissim Francez, Michael Rodeh:
Distributed k-Selection: From a Sequential to a Distributed Algorithm. 143-153 - Greg N. Frederickson:
Tradeoffs for Selection in Distributed Networks (Preliminary Version). 154-160 - Martin Dowd, Yehoshua Perl, Michael E. Saks:
The Balanced Sorting Network. 161-172
Session 4
- Richard L. Schwartz, P. M. Melliar-Smith, Friedrich H. Vogt:
An Interval Logic for Higher-Level Temporal Reasoning. 173-186 - Ron Koymans, Jan Vytopil, Willem P. de Roever:
Real-Time Programming and Asynchronous Message Passing. 187-197 - Amy L. Lansky, Susan S. Owicki:
GEM: A Tool for Concurrency Specification and Verification. 198-212 - Nissim Francez, Brent Hailpern:
Script: A Communication Abstraction Mechanism. 213-227 - Paris C. Kanellakis, Scott A. Smolka:
CCS Expressions, Finite State Processes, and THree Problems of Equivalence. 228-240 - Thomas W. Doeppner Jr., Alessandro Giacalone:
A Formal Description of the UNIX Operating System. 241-253
Session 5
- Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers in a Distributed Network. 254-266 - Henry Tirri:
Freedom from Deadlock of Locked Transactions in a Distributed Database. 267-276 - Paul Hudak:
Distributed Task and Memory Management. 277-289 - Jayadev Misra:
Detecting Termination of Distributed Computations Using Markers. 290-294 - Keith Marzullo, Susan S. Owicki:
Maintaining the Time in a Distributed System. 295-305
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.