Abstract is missing.
- Early-Delivery Dynamic Atomic BroadcastZiv Bar-Joseph, Idit Keidar, Nancy A. Lynch. 1-16 [doi]
- Secure Computation without AgreementShafi Goldwasser, Yehuda Lindell. 17-32 [doi]
- The Lord of the Rings: Efficient Maintenance of Views at Data WarehousesDivyakant Agrawal, Amr El Abbadi, Achour Mostéfaoui, Michel Raynal, Matthieu Roy. 33-47 [doi]
- Condition-Based Protocols for Set Agreement ProblemsAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy. 48-62 [doi]
- Distributed Agreement and Its Relation with Error-Correcting CodesRoy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 63-87 [doi]
- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution ProtocolsDimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. 88-102 [doi]
- Transformations of Self-Stabilizing AlgorithmsKleoni Ioannidou. 103-117 [doi]
- Simple Wait-Free Multireader RegistersPaul M. B. Vitányi. 118-132 [doi]
- An Efficient Universal Construction for Message-Passing SystemsPartha Dutta, Svend Frølund, Rachid Guerraoui, Bastian Pochon. 133-147 [doi]
- Ruminations on Domain-Based Reliable BroadcastSvend Frølund, Fernando Pedone. 148-162 [doi]
- Stateless Termination DetectionGideon Stupp. 163-172 [doi]
- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic NetworksNancy A. Lynch, Alexander A. Shvartsman. 173-190 [doi]
- Ad Hoc Membership for Scalable ApplicationsTal Anker, Danny Dolev, Ilya Shnayderman. 191-205 [doi]
- Assignment-Based Partitioning in a Condition Monitoring SystemYongqiang Huang, Hector Garcia-Molina. 206-221 [doi]
- Tight Bounds for Shared Memory Systems Accessed by Byzantine ProcessesMichael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright. 222-236 [doi]
- Failure Detection Lower Bounds on Registers and ConsensusCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. 237-251 [doi]
- Improved Compact Routing Scheme for Chordal GraphsYon Dourisboure, Cyril Gavoille. 252-264 [doi]
- A Practical Multi-word Compare-and-Swap OperationTimothy L. Harris, Keir Fraser, Ian A. Pratt. 265-279 [doi]
- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate DetectionFelix C. Gärtner, Stefan Pleisch. 280-294 [doi]
- Bounding Work and Communication in Robust Cooperative ComputationBogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman. 295-310 [doi]
- Minimal Byzantine StorageJean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin. 311-325 [doi]
- Wait-Free n-Set Consensus When Inputs Are RestrictedHagit Attiya, Zvi Avidor. 326-338 [doi]
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data StructuresMaurice Herlihy, Victor Luchangco, Mark Moir. 339-353 [doi]
- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant SystemsMarcos Kawazoe Aguilera, Gérard Le Lann, Sam Toueg. 354-370 [doi]