1. Extending stratified datalog to capture complexity classes ranging from \({\cal P} to {\cal QH}\)

   • Sergio Greco
   • Domenico Saccà
   • Carlo Zaniolo

   Original articles Pages: 699 - 725

2. Running a job on a collection of partly available machines, with on-line restarts

   • Rob van Stee
   • Han La Poutré

   Original articles Pages: 727 - 742

3. Relaxed balance for search trees with local rebalancing

   • Kim S. Larsen
   • Thomas Ottmann
   • Eljas Soisalon-Soininen

   Original articles Pages: 743 - 763

4. A polynomial time computable metric between point sets

   • Jan Ramon
   • Maurice Bruynooghe

   Original articles Pages: 765 - 780