Abstract is missing.
- Atomic Snapshots of Shared MemoryYehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit. 1-13 [doi]
- Composite RegistersJames H. Anderson. 15-29 [doi]
- The Inhibition Spectrum and the Achievement of Causal ConsistencyCarol Critchlow, Kim Taylor. 31-42 [doi]
- Lazy Replication: Exploiting the Semantics of Distributed ServicesRivka Ladin, Barbara Liskov, Liuba Shrira. 43-57 [doi]
- Distributed Variable Server for Atomic UnificationAlon Kleinman, Yoram Moses, Ehud Y. Shapiro. 59-74 [doi]
- Virtual Time II: Storage Management in Conservative and Optimistic SystemsDavid Jefferson. 75-89 [doi]
- Self-Stabilizing Extensions for Message-Passing Systems91-101 [doi]
- Self-Stabilization of Dynamic Systems Assuming only Read/Write AtomicityShlomi Dolev, Amos Israeli, Shlomo Moran. 103-117 [doi]
- Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual ExclusionAmos Israeli, Marc Jalfon. 119-131 [doi]
- Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization AlgorithmFrank B. Schmuck, Flaviu Cristian. 133-143 [doi]
- Distributed Control for PARISBaruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc Kaplan, Shay Kutten. 145-159 [doi]
- Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per LinkYoram Ofek, Moti Yung. 161-175 [doi]
- Cost-Sensitive Analysis of Communication ProtocolsBaruch Awerbuch, Alan E. Baratz, David Peleg. 177-187 [doi]
- A Quantitative Approach to Dynamic NetworksBaruch Awerbuch, Oded Goldreich, Amir Herzberg. 189-203 [doi]
- Tight Bounds for Weakly Bounded ProtocolsEwan D. Tempero, Richard E. Ladner. 205-218 [doi]
- Two Messages are Almost Optimal for Conveying InformationAlon Orlitsky. 219-232 [doi]
- A Decidable Temporal Logic to Reason About Many ProcessesE. Allen Emerson, Jai Srinivasan. 233-246 [doi]
- Reasoning About Probabilistic AlgorithmsJosyula R. Rao. 247-264 [doi]
- Using Mappings to Prove Timing PropertiesNancy A. Lynch, Hagit Attiya. 265-280 [doi]
- Half-Order Modal Logic: How to Prove Real-Time PropertiesThomas A. Henzinger. 281-296 [doi]
- Early-Delivery Atomic BroadcastAjei S. Gopal, H. Raymond Strong, Sam Toueg, Flaviu Cristian. 297-309 [doi]
- Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous SystemsSoma Chaudhuri. 311-324 [doi]
- Time- and Space-Efficient Randomized ConsensusJames Aspnes. 325-331 [doi]
- A Characterization of Eventual Byzantine AgreementJoseph Y. Halpern, Yoram Moses, Orli Waarts. 333-346 [doi]
- Lower Bounds for Wait-Free Computation in Message-Passing SystemsMaurice Herlihy, Mark R. Tuttle. 347-362 [doi]
- Sharing Memory Robustly in Message-Passing SystemsHagit Attiya, Amotz Bar-Noy, Danny Dolev. 363-375 [doi]
- A Hierarchy of Temporal PropertiesZohar Manna, Amir Pnueli. 377-410 [doi]