| 1983 | Detecting Termination of Distributed Computations Using Markers. | Jayadev Misra |
| 1983 | Maintaining the Time in a Distributed System. | Keith Marzullo, Susan S. Owicki |
| 1983 | GEM: A Tool for Concurrency Specification and Verification. | Amy L. Lansky, Susan S. Owicki |
| 1983 | Real-Time Programming and Asynchronous Message Passing. | Ron Koymans, Jan Vytopil, Willem P. de Roever |
| 1983 | CCS Expressions, Finite State Processes, and THree Problems of Equivalence. | Paris C. Kanellakis, Scott A. Smolka |
| 1983 | Distributed Task and Memory Management. | Paul Hudak |
| 1983 | Tradeoffs for Selection in Distributed Networks (Preliminary Version). | Greg N. Frederickson |
| 1983 | Script: A Communication Abstraction Mechanism. | Nissim Francez, Brent Hailpern |
| 1983 | The Inherent Cost of Nonblocking Commitment. | Cynthia Dwork, Dale Skeen |
| 1983 | The Balanced Sorting Network. | Martin Dowd, Yehoshua Perl, Michael E. Saks |
| 1983 | A Formal Description of the UNIX Operating System. | Thomas W. Doeppner Jr., Alessandro Giacalone |
| 1983 | An Algorithm for Replicated Directories. | Dean S. Daniels, Alfred Z. Spector |
| 1983 | Scheduling File Transfers in a Distributed Network. | Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh |
| 1983 | Resilient Consensus Protocols. | Gabriel Bracha, Sam Toueg |
| 1983 | The Failure and Recovery Problem for Replicated Databases. | Philip A. Bernstein, Nathan Goodman |
| 1983 | Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). | Michael Ben-Or |
| 1983 | A Concurrency Control Theory for Nested Transactions. | Catriel Beeri, Philip A. Bernstein, Nathan Goodman |
| 1983 | Decentralization of Process Nets with Centralized Control. | Ralph-Johan Back, Reino Kurki-Suonio |
| 1983 | Synchronization and Recovery of Actions. | James E. Allchin, Martin S. McKendry |
| 1982 | Testing Incomplete Specifications of Distributed Systems. | Pamela Zave |
| 1982 | Efficient Schemes for Parallel Communication. | Eli Upfal |
| 1982 | On Parallel Searching (Extended Abstract). | Marc Snir |
| 1982 | Can Message Buffers be Characterized in Linear Temporal Logic? | A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Yuri Gurevich |
| 1982 | A Multi-Version Concurrency Scheme With No Rollbacks. | Abraham Silberschatz |
| 1982 | N-Processors Graph Distributively Achieve Perfect Matchings in O(log | Eli Shamir, Eli Upfal |