1. On computing the transitive closure of a relation

   • J. Eve
   • R. Kurki-Suonio

   OriginalPaper Pages: 303 - 314

2. On a new approach to representation independent data classes

   • R. D. Tennent

   OriginalPaper Pages: 315 - 324

3. Concurrent access to data

   • N. Ramsperger

   OriginalPaper Pages: 325 - 334

4. Some comments on “concurrent readers and writers”

   • Reidar Conradi

   OriginalPaper Pages: 335 - 340

5. A feedback-coupled resource allocation policy for multiprogrammed computer systems

   • Hisao Kameda
   • Calvin C. Gotlieb

   OriginalPaper Pages: 341 - 357

6. A note on the influence of program loading on the page fault rate

   • Michel Parent
   • Dominique Potier

   OriginalPaper Pages: 359 - 370

7. The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet

   • Burkhard Monien

   OriginalPaper Pages: 371 - 382

8. Corrigenda

   • Burkhard Monien

   Erratum Pages: 383 - 384