1. Average-case results on heapsort

   • Svante Carlsson

   Part I Computer Science Pages: 2 - 17

2. Generating and counting triangular systems

   • Rade Doroslovački
   • Ivan Stojmenović
   • Ratko Tošić

   Part I Computer Science Pages: 18 - 24

3. Array processing machines: An abstract model

   • J. van Leeuwen
   • J. Wiedermann

   Part I Computer Science Pages: 25 - 43

4. A generalized, one-way, stackless quicksort

   • Lutz M. Wegner

   Part I Computer Science Pages: 44 - 48

5. A ℤ-Simplex Algorithm with partial updates

   • Adi Ben-Israel

   Part II Numerical Mathematics Pages: 50 - 61

6. The order ofB-convergence of algebraically stable Runge-Kutta methods

   • K. Burrage
   • W. H. Hundsdorfer

   Part II Numerical Mathematics Pages: 62 - 71

7. Convergence of Gauss type product formulas for the evaluation of two-dimensional Cauchy principal value integrals

   • Giuliana Criscuolo
   • Giuseppe Mastroianni

   Part II Numerical Mathematics Pages: 72 - 84

8. On the error term of the filon quadrature formulae

   • Ulf Torsten Ehrenmark

   Part II Numerical Mathematics Pages: 85 - 97

9. Sharp bounds for the partition function of integer sequences

   • Daniel C. Mayer

   Part II Numerical Mathematics Pages: 98 - 110

10. On some iteration functions for the simultaneous computation of multiple complex polynomial zeros

    • Miodrag S. Petković
    • Lidija V. Stefanović

    Part II Numerical Mathematics Pages: 111 - 122

11. A ₀-stable linear multistep formulas of theα-type

    • Gary K. Rockswold

    Part II Numerical Mathematics Pages: 123 - 128

12. Problems

    Legacy Pages: 129 - 130

13. New books and journals

    Announcement Pages: 131 - 131

14. Notes

    Announcement Pages: 132 - 132