1. Some efficient solutions to the affine scheduling problem. I. One-dimensional time

   • Paul Feautrier

   OriginalPaper Pages: 313 - 347

2. A parallel algorithm for the 0–1 knapsack problem

   • W. Loots
   • T. H. C. Smith

   OriginalPaper Pages: 349 - 362

3. A parallel programming environment supporting multiple data-parallel modules

   • Bradley K. Seevers
   • Michael J. Quinn
   • Philip J. Hatcher

   OriginalPaper Pages: 363 - 386