16. DISC 2002: Toulouse, France

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