1. A fair calculus of communicating systems

   • Gerardo Costa
   • Colin Stirling

   OriginalPaper Pages: 417 - 441

2. A set-theoretic semantics for Clear

   • D. T. Sannella

   OriginalPaper Pages: 443 - 472

3. Polyvariant mixed computation for analyzer programs

   • M. A. Bulyonkov

   OriginalPaper Pages: 473 - 484

4. The paging drum queue: A uniform perspective and further results

   • C. H. C. Leung
   • Q. H. Choo

   OriginalPaper Pages: 485 - 500

5. Space sweep solves intersection of convex polyhedra

   • Stefan Hertel
   • Martti Mäntylä
   • Jurg Nievergelt

   OriginalPaper Pages: 501 - 519

6. Finite complete rewriting systems and the complexity of the word problem

   • G. Bauer
   • F. Otto

   OriginalPaper Pages: 521 - 540