A methodology for measuring the readability and modifiability of computer programs Anker Helms Jørgensen Part I Computer Science Pages: 393 - 405
The rectangle intersection problem revisited H. -W. SixD. Wood Part I Computer Science Pages: 426 - 433
Transfer of programs from development to runtime environments Dan StrömbergPeter Fritzson Part I Computer Science Pages: 434 - 442
The mühlbach-neville-aitken algorithm and some extensions C. Brezinski Part II Numerical Mathematics Pages: 443 - 451
Simplifying assumptions for the order of partitioned multivalue methods Kevin BurragePamela Moss Part II Numerical Mathematics Pages: 452 - 465
Interpolatory inner product quadrature formulas J. D. Gribble Part II Numerical Mathematics Pages: 466 - 474
An efficient step size control for continuation methods J. HacklHJ. WackerW. Zulehner Part II Numerical Mathematics Pages: 475 - 485
Error estimation and iterative improvement for discretization algorithms Bengt Lindberg Part II Numerical Mathematics Pages: 486 - 500
Solving nonlinear simultaneous equations with a generalization of Brent's method José Mario Martínez Part II Numerical Mathematics Pages: 501 - 510
A new fourth order method for computing eigenvalues of two-point boundary value problems M. M. ChawlaC. P. Katti Scientific Notes Pages: 511 - 514
The number of conjugacy classes of the alternating group Robert D. Girse Scientific Notes Pages: 515 - 517
A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths Sukhamay Kundu Scientific Notes Pages: 522 - 524
The behavior of a multiplicity independent root-finding scheme in the presence of error G. W. Stewart Scientific Notes Pages: 526 - 528
