Abstract is missing.
- Language Constructs and Support Systems for Distributed ComputingCarla Schlatter Ellis, Jerome A. Feldman, James E. Heliotis. 1-9
- Distributed Communication via Global BufferDavid Gelernter, Arthur J. Bernstein. 10-18
- Language Concepts for Distributed Processing of Large ArraysPiyush Mehrotra, Terrence W. Pratt. 19-28
- Dynamic Systems and Their Distributed TerminationShimon Cohen, Daniel J. Lehmann. 29-33
- UIDS as Internal Names in a Distributed File SystemPaul J. Leach, Bernard L. Stumpf, James A. Hamilton, Paul H. Levine. 34-41
- Testing Incomplete Specifications of Distributed SystemsPamela Zave. 42-48
- Distributed Multi-Destination Routing: The Constraints of Local InformationJeffrey M. Jaffe. 49-54
- Efficient Schemes for Parallel CommunicationEli Upfal. 55-59
- Distributed Allocation with Pools of ServersGregory R. Andrews, David P. Dobkin, Peter J. Downey. 73-83
- Real Time Resource Allocation in Distributed SystemsJohn H. Reif, Paul G. Spirakis. 84-94
- Finding Safe Paths in a Faulty EnvironmentDanny Dolev, José Meseguer, Marshall C. Pease. 95-103
- Four Combinators for ConcurrencyRobin Milner. 104-110
- A Refinement of Kahn s Semantic to Handle Non-Determinism and Communication (Extended Abstract)Ralph-Johan Back, Heikki Mannila. 111-120
- On the Distribution of an AssertionOsvaldo Carvalho, Gérard Roucairol. 121-131
- Bounds on Information Exchange for Byzantine AgreementDanny Dolev, Rüdiger Reischuk. 132-140
- Understanding and Using Asynchronous Message Passing (Preliminary Version)Richard D. Schlichting, Fred B. Schneider. 141-147
- Can Message Buffers be Characterized in Linear Temporal Logic?A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich. 148-156
- A Distributed Algorithm for Detecting Resource Deadlocks in Distributed SystemsK. Mani Chandy, Jayadev Misra. 157-164
- On-the-fly Deadlock PreventionGregory R. Andrews, Gary Levin. 165-172
- Edge Locks and Deadlock Avoidance in Distributed SystemsHenry F. Korth. 173-182
- Why Control of the Concurrency Level in Distributed Systems is More Fundamental Than Deadlock ManagementR. Balter, P. Berard, Paul Decitre. 183-193
- On Serializability of Iterated TransactionsMarie-Paule Flé, Gérard Roucairol. 194-200
- Proving Safety and Liveness of Communicating Processes with ExamplesJayadev Misra, K. Mani Chandy, Todd Smith. 201-208
- Concurrency Control Algorithms for Multiversion Database SystemsArthur J. Bernstein, Nathan Goodman. 209-215
- A Multi-Version Concurrency Scheme With No RollbacksAbraham Silberschatz. 216-223
- A Distributed Transaction Processing Protocol Based on Majority ConsensusH. Breitwieser, M. Leszak. 224-237
- N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) BeatsEli Shamir, Eli Upfal. 238-241
- On Parallel Searching (Extended Abstract)Marc Snir. 242-253
- Folding and Unrolling Systolic Arrays (Preliminary Version)Karel Culik II, Jan K. Pachl. 254-261