1. A parallel search algorithm for directed acyclic graphs

   • Ratan K. Ghosh
   • G. P. Bhattacharjee

   Part I Computer Science Pages: 133 - 150

2. Delaunay triangulation and the convex hull ofn points in expected linear time

   • Arne Maus

   Part I Computer Science Pages: 151 - 163

3. On context-free and Szilard languages

   • Erkki Mäkinen

   Part I Computer Science Pages: 164 - 170

4. Specification of a query language by the attribute method

   • Timo Niemi

   Part I Computer Science Pages: 171 - 186

5. A new parallel sorting algorithm based upon min-mid-max operations

   • S. S. Tseng
   • R. C. T. Lee

   Part I Computer Science Pages: 187 - 195

6. A new algorithm for generation of permutations

   • Shmuel Zaks

   Part I Computer Science Pages: 196 - 204

7. Solving the minimal least squares problem subject to bounds on the variables

   • Per Lötstedt

   Part II Numerical Mathematics Pages: 205 - 224

8. Phase properties of high order, almostP-stable formulae

   • R. M. Thomas

   Part II Numerical Mathematics Pages: 225 - 238

9. On the use of Gauss quadrature in adaptive automatic integration schemes

   • Jarle Berntsen
   • Terje O. Espelid

   Scientific Notes Pages: 239 - 242

10. On runs of consecutive quadratic residues and quadratic nonresidues

    • Duncan A. Buell
    • Richard H. Hudson

    Scientific Notes Pages: 243 - 247

11. EfficientP-stable methods for periodic initial value problems

    • J. R. Cash

    Scientific Notes Pages: 248 - 252

12. The numerical approximation of a class of finite integrals

    • H. V. Smith

    Scientific Notes Pages: 253 - 256

13. Problems

    Legacy Pages: 257 - 258

14. New books and journals

    Announcement Pages: 259 - 259

15. Notes

    Announcement Pages: 260 - 260