1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

   • Stefan Arnborg

   Part I Computer Science Pages: 1 - 23

2. The nature of data — From measurements to systems

   • Ole Immanuel Franksen

   Part I Computer Science Pages: 24 - 50

3. Automated theorem proving methods

   • Rolf Nossum

   Part I Computer Science Pages: 51 - 64

4. Computer networking of Nordic universities

   • Martti Tienari

   Part I Computer Science Pages: 65 - 69

5. Significant improvements to the Ford-Johnson algorithm for sorting

   • T. D. Bui
   • Mai Thanh

   Part I Computer Science Pages: 70 - 75

6. The power of geometric duality

   • Bernard Chazelle
   • Leo J. Guibas
   • D. T. Lee

   Part I Computer Science Pages: 76 - 90

7. A language-driven generalized numerical database translator

   • Ola-Olu A. Daini

   Part I Computer Science Pages: 91 - 105

8. Analysis of the performance of the parallel quicksort method

   • D. J. Evans
   • Nadia Y. Yousif

   Part I Computer Science Pages: 106 - 112

9. Approximate counting: A detailed analysis

   • Philippe Flajolet

   Part I Computer Science Pages: 113 - 134

10. On search by address computation

    • Markku Tamminen

    Part I Computer Science Pages: 135 - 147

11. A backtracking method for constructing perfect hash functions from a set of mapping functions

    • W. P. Yang
    • M. W. Du

    Part I Computer Science Pages: 148 - 164

12. A survey of preconditioned iterative methods for linear systems of algebraic equations

    • O. Axelsson

    Part II Numerical Mathematics Pages: 165 - 187

13. 33 years of numerical instability, Part I

    • Germund Dahlquist

    Part II Numerical Mathematics Pages: 188 - 204

14. Modern factorization methods

    • Hans Riesel

    Part II Numerical Mathematics Pages: 205 - 222

15. Ordinary Papers

    • Giovanni Di Lena
    • Roberto I. Peluso

    Part II Numerical Mathematics Pages: 223 - 232

16. Multiderivative Runge-Kutta processes for two-point boundary value problems

    • Suchitra Gupta

    Part II Numerical Mathematics Pages: 233 - 241

17. A simple quadrature-type method for the computation of real zeros of analytic functions in finite intervals

    • N. I. Ioakimidis
    • E. G. Anastasselou

    Part II Numerical Mathematics Pages: 242 - 249

18. Fifth order implicit multipoint method for solving equations

    • M. K. Jain

    Part II Numerical Mathematics Pages: 250 - 255

19. Interval iteration for zeros of systems of equations

    • A. Neumaier

    Part II Numerical Mathematics Pages: 256 - 273

20. Pivoting rules and redundancy schemes in extreme point enumeration

    • Stein W. Wallace

    Part II Numerical Mathematics Pages: 274 - 280

21. Stability analysis of methods employing reducible rules for volterra integral equations of the first kind

    • S. Amini

    Scientific Notes Pages: 281 - 284

22. A necessary condition forBSI-stability

    • Kees Dekker
    • Ernst Hairer

    Scientific Notes Pages: 285 - 288

23. NP-completeness of the hamming salesman problem

    • Jarmo Ernvall
    • Jyrki Katajainen
    • Martti Penttonen

    Scientific Notes Pages: 289 - 292

24. A note on depth-first derivations

    • Erkki Mäkinen

    Scientific Notes Pages: 293 - 296

25. All symmetric interpolatory block-implicit methods of order less than six are A-stable

    • M. Reimer

    Scientific Notes Pages: 297 - 298

26. Problems

    Legacy Pages: 299 - 300

27. Books received

    Announcement Pages: 300 - 300