Computing parent nodes in threaded binary trees Keith Brinck Part I Computer Science Pages: 401 - 409
On the design of a Key-Lock-Pair mechanism in information protection systems C. C. Chang Part I Computer Science Pages: 410 - 417
Parallel algorithms for analyzing activity networks Pranay ChaudhuriRatan K. Ghosh Part I Computer Science Pages: 418 - 429
Reconstructing visible regions from visible segments W. Randolph FranklinVarol Akman Part I Computer Science Pages: 430 - 441
On systolic arrays for updating the Cholesky factorization Robert SchreiberWei-Pai Tang Part I Computer Science Pages: 451 - 466
A dynamic programming approach to the complete set partitioning problem D. Yun Yeh Part I Computer Science Pages: 467 - 474
Unrestricted algorithms for reciprocals and square roots C. W. ClenshawF. W. J. Olver Part II Numerical Mathematics Pages: 475 - 492
On computingINV block preconditionings for the conjugate gradient method P. ConcusG. Meurant Part II Numerical Mathematics Pages: 493 - 504
Error bounds for multistep methods revisited Rolf JeltschOlavi Nevanlinna Part II Numerical Mathematics Pages: 505 - 520
On numerical evaluation of double integrals of an analytic function of two complex variables G. V. MilovanovićB. P. AcharyaT. N. Pattnaik Part II Numerical Mathematics Pages: 521 - 526
Convex interpolating splines of arbitrary degree. III Edward Neuman Part II Numerical Mathematics Pages: 527 - 536
Initial approximations in Durand-Kerner's root finding method H. Guggenheimer Scientific Notes Pages: 537 - 539
