1. On binary operators and their derived relations

   • Edsger W. Dijkstra

   Part I Educational Papers Pages: 377 - 382

2. Tutorial on analytical methods as a complement to numerical computing

   • Bo Einarsson

   Part I Educational Papers Pages: 383 - 390

3. On admissible constellations of consecutive primes

   • Paul Erdös
   • Hans Riesel

   Part I Educational Papers Pages: 391 - 396

4. Basic concepts of algorithms and programming to be taught in a school course in informatics

   • Andrei P. Ershov

   Part I Educational Papers Pages: 397 - 405

5. On a combinatorial problem related to permanents

   • Carl-Erik Fröberg

   Part I Educational Papers Pages: 406 - 411

6. On formalisms

   • Brian Mayoh

   Part I Educational Papers Pages: 412 - 426

7. A design method for embedded software systems

   • Anders P. Ravn
   • Hans Rischel
   • Hans Henrik Løvengreen

   Part I Educational Papers Pages: 427 - 438

8. Array theory and the nial programming language

   • K. W. Smillie

   Part I Educational Papers Pages: 439 - 449

9. Datalogy — The copenhagen tradition of computer science

   • Edda Sveinsdottir
   • Erik Frøkjær

   Part I Educational Papers Pages: 450 - 472

10. Time considered irrelevant for real-time systems

    • W. M. Turski

    Part I Educational Papers Pages: 473 - 486

11. An efficiency comparison of some representations of purely functional arrays

    • Annika Aasa
    • Sören Holmström
    • Christina Nilsson

    Part II Computer Science Pages: 489 - 503

12. Metric semantics for concurrency

    • J. W. de Bakker
    • J. -J. Ch. Meyer

    Part II Computer Science Pages: 504 - 529

13. The semantics and complexity of parallel programs for vector computations. Part I: A case study using ADA

    • Edward K. Blum

    Part II Computer Science Pages: 530 - 551

14. Arranging apples in an array

    • Jens Clausen
    • Jakob Krarup

    Part II Computer Science Pages: 552 - 568

15. Generating a random cyclic permutation

    • David Gries
    • Jinyun Xue

    Part II Computer Science Pages: 569 - 572

16. Inductive inference of ultimately periodic sequences

    • Peter Johansen

    Part II Computer Science Pages: 573 - 580

17. On the design of reactive systems

    • R. Kurki-Suonio
    • T. Kankaanpää

    Part II Computer Science Pages: 581 - 604

18. Terminating general recursion

    • Bengt Nordström

    Part II Computer Science Pages: 605 - 619

19. From high-level descriptions to vlsi circuits

    • J. Staunstrup
    • M. R. Greenstreet

    Part II Computer Science Pages: 620 - 638

20. Simd language design using prescriptive semantics

    • Alan Stewart

    Part II Computer Science Pages: 639 - 649

21. On the stability of rational approximations to the cosine with only imaginary poles

    • Laurence A. Bales
    • Ohannes A. Karakashian
    • Steve M. Serbin

    Part III Numerical Mathematics Pages: 651 - 658

22. A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations

    • Åke Björck

    Part III Numerical Mathematics Pages: 659 - 670

23. Uniformly distributed sums of bernoulli variables

    • Hanne Dalgas Christiansen

    Part III Numerical Mathematics Pages: 671 - 677

24. Error of Runge-Kutta methods for stiff problems studied via differential algebraic equations

    • E. Hairer
    • Ch. Lubich
    • M. Roche

    Part III Numerical Mathematics Pages: 678 - 700

25. A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems

    • Frank Körner

    Part III Numerical Mathematics Pages: 701 - 708

26. Solving sparse linear systems by an abs-method that corresponds toLU-decomposition

    • Kang Hoh Phua

    Part III Numerical Mathematics Pages: 709 - 718

27. Problems

    Legacy Pages: 719 - 724

28. Peter Naur on his 60th birthday, October 25, 1988

    • Erik Bruhn
    • Carl-Erik Fröberg
    • Christian Gram

    Announcement Pages: ii - iv