Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar1. PODC 1982: Ottawa, Canada
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookRobert L. Probert, Michael J. Fischer, Nicola Santoro:
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, CanadaAugust 18-20, 1982. ACM 1982, ISBN 0-89791-081-8
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, CanadaAugust 18-20, 1982. ACM 1982, ISBN 0-89791-081-8
Session 1
Carla Schlatter Ellis, Jerome A. Feldman, James E. Heliotis:
Language Constructs and Support Systems for Distributed Computing. 1-9- Piyush Mehrotra, Terrence W. Pratt:
Language Concepts for Distributed Processing of Large Arrays. 19-28 - Paul J. Leach, Bernard L. Stumpf, James A. Hamilton, Paul H. Levine:
UIDS as Internal Names in a Distributed File System. 34-41
Session 2
- Jeffrey M. Jaffe:
Distributed Multi-Destination Routing: The Constraints of Local Information. 49-54 - Gregory R. Andrews, David P. Dobkin, Peter J. Downey:
Distributed Allocation with Pools of Servers. 73-83
Session 3
- Ralph-Johan Back, Heikki Mannila:
A Refinement of Kahn's Semantic to Handle Non-Determinism and Communication (Extended Abstract). 111-120 - Richard D. Schlichting, Fred B. Schneider:
Understanding and Using Asynchronous Message Passing (Preliminary Version). 141-147 - A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich:
Can Message Buffers be Characterized in Linear Temporal Logic? 148-156
Session 4
- K. Mani Chandy, Jayadev Misra:
A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems. 157-164 - R. Balter, P. Berard, Paul Decitre:
Why Control of the Concurrency Level in Distributed Systems is More Fundamental Than Deadlock Management. 183-193 - Jayadev Misra, K. Mani Chandy, Todd Smith:
Proving Safety and Liveness of Communicating Processes with Examples. 201-208
Session 5
- Philip A. Bernstein, Nathan Goodman:
Concurrency Control Algorithms for Multiversion Database Systems. 209-215 - H. Breitwieser, M. Leszak:
A Distributed Transaction Processing Protocol Based on Majority Consensus. 224-237 - Eli Shamir, Eli Upfal:
N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats. 238-241
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-20 06:40 CEST by the dblp team