1. On the message complexity of binary byzantine agreement under crash failures

   • Eugene S. Amdur
   • Samuel M. Weber
   • Vassos Hadzilacos

   OriginalPaper Pages: 175 - 186

2. On-the-fly garbage collection for several mutators

   • Jan E. Jonker

   OriginalPaper Pages: 187 - 199

3. Efficient parallel algorithms can be made robust

   • Paris C. Kanellakis
   • Alex A. Shvartsman

   OriginalPaper Pages: 201 - 217

4. A self-adjusting algorithm for byzantine agreement

   • Yi Zhao
   • Farokh B. Bastani

   OriginalPaper Pages: 219 - 226