205 | -- | 217 | Mohand Ourabah Benouamer, P. Jaillon, Dominique Michelucci, Jean-Michel Moreau. Hashing lazy numbers |
219 | -- | 232 | Xavier Merrheim. The computation of elementary functions in radix 2:::::::p::::::: |
233 | -- | 242 | Michael J. Schulte, J. Omar, Earl E. Swartzlander Jr.. Optimal initial approximations for the Newton-Raphson division algorithm |
243 | -- | 257 | Roman Reith, Christian P. Ullrich. Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers |
259 | -- | 276 | Gerd Bohlender, T. Kersten, R. Trier. Implicit matrix multiplication with maximum accuracy on various transputer networks |
277 | -- | 287 | Olaf Knüppel. PROFIL/BIAS - A fast interval library |
301 | -- | 310 | J. F. Carpraux, J. Erhel, M. Sadkane. Spectral portrait for non-hermitian large sparse matrices |
311 | -- | 322 | Götz Alefeld, A. Gienger, Günter Mayer. Numerical validation for an inverse matrix eigenvalue problem |
323 | -- | 335 | H. Hong, V. Stahl. Safe starting regions by fixed points and tightening |
337 | -- | 353 | Dietmar Ratz. Box-Splitting strategies for the interval Gauss-Seidel step in a global optimization method |
365 | -- | 368 | Jiri Rohn. Enclosing solutions of linear interval equations is NP-hard |
379 | -- | 395 | M. Neher. Enclosing solutions of an inverse Sturm-Liouville problem with finite data |