1. Generating combinations in parallel

   • Becky Chan
   • Selim G. Akl

   Part I Computer Science Pages: 1 - 6

2. AnO(N logN) minimal spanning tree algorithm forN points in the plane

   • R. C. Chang
   • R. C. T. Lee

   Part I Computer Science Pages: 7 - 16

3. Brownian motion and algorithm complexity

   • G. Louchard

   Part I Computer Science Pages: 17 - 34

4. An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

   • Michael J. Quinn
   • Narsingh Deo

   Part I Computer Science Pages: 35 - 43

5. An algorithm for the enumeration of spanning trees

   • Pawel Winter

   Part I Computer Science Pages: 44 - 62

6. Phase-lag analysis of explicit Nyström methods fory″=f(x,y)

   • M. M. Chawla
   • P. S. Rao

   Part II Numerical Mathematics Pages: 63 - 70

7. Multivariate Padé approximants revisited

   • Annie Cuyt

   Part II Numerical Mathematics Pages: 71 - 79

8. On regularization and discretization control for the numerical solution of inverse problems in parabolic equations

   • Bernd Hofmann
   • Volkmar Friedrich

   Part II Numerical Mathematics Pages: 80 - 92

9. Derivative free multipoint iterative methods for simple and multiple roots

   • S. R. K. Iyengar
   • R. K. Jain

   Part II Numerical Mathematics Pages: 93 - 99

10. Local error control inSDIRK-methods

    • Syvert P. Nørsett
    • Per G. Thomsen

    Part II Numerical Mathematics Pages: 100 - 113

11. Circle contractive linear multistep methods

    • Jørgen Sand

    Part II Numerical Mathematics Pages: 114 - 122

12. An explicit cubic iteration for π

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

    Scientific Notes Pages: 123 - 126

13. A one-way, stackless quicksort algorithm

    • Huang Bing-Chao
    • Donald E. Knuth

    Scientific Notes Pages: 127 - 130

14. The convergence of interpolatory product integration rules

    • Philip Rabinowitz

    Scientific Notes Pages: 131 - 134

15. Problems

    Legacy Pages: 135 - 135

16. Notes

    Announcement Pages: 136 - 136