1. A generalized hypergreedy algorithm for weighted perfect matching

   • Celina Imielinska
   • Bahman Kalantari

   Part I Computer Science Pages: 177 - 189

2. Performance bounds on multiprocessor scheduling strategies for statically allocated programs

   • Lars Lundberg

   Part I Computer Science Pages: 190 - 213

3. Execution of logic programs by iterative-deepening A* SLD-tree search

   • Roland Olsson

   Part I Computer Science Pages: 214 - 231

4. On crossing numbers of hypercubes and cube connected cycles

   • Ondrej Sýkora
   • Imrich Vrťo

   Part I Computer Science Pages: 232 - 237

5. Efficiently updating constrained Delaunay triangulations

   • Cao An Wang

   Part I Computer Science Pages: 238 - 252

6. An integer based square root algorithm

   • Tony Barrera
   • Pelle Olsson

   Part II Numerical Mathematics Pages: 253 - 261

7. A row relaxation method for large minimax problems

   • Achiya Dax

   Part II Numerical Mathematics Pages: 262 - 276

8. Is the recurrence relation for orthogonal polynomials always stable?

   • Walter Gautschi

   Part II Numerical Mathematics Pages: 277 - 284

9. Stiffness of ODEs

   • Desmond J. Higham
   • Lloyd N. Trefethen

   Part II Numerical Mathematics Pages: 285 - 303

10. A perturbation bound for the generalized polar decomposition

    • Ren-Cang Li

    Part II Numerical Mathematics Pages: 304 - 308

11. High-order adaptive finite element-singly implicit Runge-Kutta methods for parabolic differential equations

    • Peter K. Moore
    • Joseph E. Flaherty

    Part II Numerical Mathematics Pages: 309 - 331

12. Numerical experiments with a multistep Radau method

    • Stefan Schneider

    Part II Numerical Mathematics Pages: 332 - 350

13. New books and journals

    Announcement Pages: 351 - 351