1. On the implementation of implicit Runge-Kutta methods

   • J. C. Butcher

   OriginalPaper Pages: 237 - 240

2. Experiments with a symbolic programming system for complex analysis

   • J. A. Campbell
   • J. G. Kent
   • R. J. Moore

   OriginalPaper Pages: 241 - 256

3. Guaranteed error bounds for the initial value problem using polytope arithmetic

   • D. P. Davey
   • N. F. Stewart

   OriginalPaper Pages: 257 - 268

4. Zig-Zag procedures for memory allocation and retrieval of dense equilateral arrays of dynamically varying order

   • Åke Hansson
   • Sten-Åke Tärnlund

   OriginalPaper Pages: 269 - 274

5. A characterization ofLL(1) grammars

   • Donald B. Johnson
   • Ravi Sethi

   OriginalPaper Pages: 275 - 280

6. Discrete cubic spline interpolation

   • Tom Lyche

   OriginalPaper Pages: 281 - 290

7. Root determination by use of Padé approximants

   • Abdel-Wahab M. Nourein

   OriginalPaper Pages: 291 - 297

8. On the optimal approximation of bounded linear functionals in Hilbert spaces of analytic functions

   • Augustin Paulik

   OriginalPaper Pages: 298 - 307

9. On binary-exponent alternating sums

   • Peter Pohl

   OriginalPaper Pages: 308 - 312

10. Numerical inversion of Mellin transforms

    • G. Tsamasphyros
    • P. S. Theocaris

    OriginalPaper Pages: 313 - 321

11. A case study in program transformation

    • Arne Wang

    OriginalPaper Pages: 322 - 331

12. Sequence search trees: Their analysis using recurrence relations

    • L. B. Wilson

    OriginalPaper Pages: 332 - 337

13. A short note on convergence near a high order zero

    • Gaston H. Gonnet

    Scientific Notes Pages: 338 - 339

14. Compilers should indent

    • Bruce Knobe
    • Gideon Yuval

    Scientific Notes Pages: 340 - 343

15. Problems

    Legacy Pages: 344 - 346

16. Newton-like methods for two-point boundary value problems

    Erratum Pages: 346 - 346

17. Notes

    Announcement Pages: 346 - 347

18. New books and journals

    Announcement Pages: 347 - 347