1. Efficient algorithms for merging

   • V. S. Alagar
   • T. D. Bui
   • Mai Thanh

   Part I Computer Science Pages: 409 - 428

2. An analysis of the generalized Towers of Hanoi problem

   • M. C. Er

   Part I Computer Science Pages: 429 - 435

3. Binary search trees with limited rotation

   • Shou-Hsuan Stephen Huang
   • C. K. Wong

   Part I Computer Science Pages: 436 - 455

4. On the X-Y convex hull of a set of X-Y polygons

   • T. M. Nicholl
   • D. T. Lee
   • C. K. Wong

   Part I Computer Science Pages: 456 - 471

5. Properties and applications of forests of quadtrees for pictorial data representation

   • Vasudevan Raman
   • S. Sitharama Iyengar

   Part I Computer Science Pages: 472 - 486

6. Extended product integration rules

   • Catterina Dagnino

   Part II Numerical Mathematics Pages: 487 - 499

7. Perturbation bounds for the linear least squares problem subject to linear inequality constraints

   • Per Lötstedt

   Part II Numerical Mathematics Pages: 500 - 519

8. Stability of difference schemes for a class of partial differential equations

   • Qin Mengzhao

   Part II Numerical Mathematics Pages: 520 - 528

9. Max-min resource allocation

   • K. M. Mjelde

   Part II Numerical Mathematics Pages: 529 - 537

10. A very rapidly convergent product expansion for π

    • J. M. Borwein
    • P. B. Borwein

    Scientific Notes Pages: 538 - 540

11. Unconditionally stable noumerov-type methods for second order differential equations

    • M. M. Chawla

    Scientific Notes Pages: 541 - 542

12. Some new consistency relations connecting spline values at mesh and mid points

    • Manabu Sakai

    Scientific Notes Pages: 543 - 546

13. A prime gap of 682 and a prime arithmetic sequence

    • S. Weintraub

    Erratum Pages: 546 - 546

14. Problems

    Legacy Pages: 547 - 548

15. Notes

    Announcement Pages: 549 - 549

16. Acknowledgements

    Acknowledgments Pages: 550 - 550