1. An algorithm for then×n optimum assignment problem

   • Kabekode V. S. Bhat
   • Bharat Kinariwala

   OriginalPaper Pages: 289 - 296

2. Partitions in squares

   • Jan Bohman
   • Carl-Erik Fröberg
   • Hans Riesel

   OriginalPaper Pages: 297 - 301

3. Hashing techniques, a global approach

   • R. Devillers
   • G. Louchard

   OriginalPaper Pages: 302 - 311

4. A linear time approximation algorithm for multiprocessor scheduling

   • Greg Finn
   • Ellis Horowitz

   OriginalPaper Pages: 312 - 320

5. A method for computing all the zeros of a polynomial with real coefficients

   • T. L. Freeman

   OriginalPaper Pages: 321 - 333

6. Monitors with associated processors

   • Stein Gjessing

   OriginalPaper Pages: 334 - 346

7. P-stable methods for periodic initial value problems of second order differential equations

   • M. K. Jain
   • R. K. Jain
   • U. Anantha Krishnaiah

   OriginalPaper Pages: 347 - 355

8. Accelerated Gauss-Newton algorithms for nonlinear least squares problems

   • Axel Ruhe

   OriginalPaper Pages: 356 - 367

9. Cubature formulas for the evaluation of surface singular integrals

   • G. Tsamasphyros
   • P. S. Theocaris

   OriginalPaper Pages: 368 - 377

10. An explicit difference method for the wave equation with extended stability range

    • E. H. Twizell

    OriginalPaper Pages: 378 - 383

11. The application of iterated defect correction to theLod method for parabolic equations

    • J. G. Verwer

    OriginalPaper Pages: 384 - 394

12. An extension ofA-stability to alternating direction implicit methods

    • R. F. Warming
    • Richard M. Beam

    OriginalPaper Pages: 395 - 417

13. A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm

    • Jin Kue Wong

    OriginalPaper Pages: 418 - 424

14. Problems

    Legacy Pages: 425 - 426

15. New books and journals

    Announcement Pages: 427 - 427

16. Notes

    Announcement Pages: 427 - 427