Parallel Algorithms and Applications, Volume 13

Volume 13, Number 4, 1999

• Laurence Tianruo Yang, Hai-Xiang Lin:
  Solving Sparse Least Squares Problems with Preconditioned Cgls Method on Parallel Distributed Memory Computers. 289-305
  Electronic Edition (link) BibTeX
• Selim G. Akl, Lin Chen:
  On the Power of some Pram Models. 307-319
  Electronic Edition (link) BibTeX
• Toomas P. Plaks:
  Efficient Mapping Reductions Using Iso-planes on the Polytope Model. 321-343
  Electronic Edition (link) BibTeX
• Giorgio Pini, Flavio Sartoretto:
  A Parallel Finite Element Code for Nonlinear Leaky Aquifer Systems. 345-361
  Electronic Edition (link) BibTeX

Volume 13, Number 3, 1999

• M. V. Padmini, B. B. Madan, Bijendra N. Jain:
  A Linear Array for Large Sparse Matrix Operations - I Cholesky Factorization. 187-215
  Electronic Edition (link) BibTeX
• M. V. Padmini, B. B. Madan, Bijendra N. Jain:
  A Linear Array for Large Sparse Matrix Operations - Ii Triangular System Solvers and Matrix Multiplication. 217-237
  Electronic Edition (link) BibTeX
• R. K. Mohanty, David J. Evans:
  Block Iterative Methods for One Dimensional Nonlinear Biharmonic Problems on a Parallel Computer. 239-263
  Electronic Edition (link) BibTeX
• Martin Becka, Marián Vajtersic:
  Block-jacobi Svd Algorithms for Distributed Memory Systems I: Hypercubes and Rings. 265-287
  Electronic Edition (link) BibTeX

Volume 13, Number 2, 1998

• Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang:
  Efficient Emulations for X-trees and /w-ary Trees. 95-116
  Electronic Edition (link) BibTeX
• Jean-Claude König, P. S. Rao, Denis Trystram:
  Analysis of Gossiping Algorithms with Restricted Buffers. 117-133
  Electronic Edition (link) BibTeX
• Jarmo Rantakokko:
  A Framework for Partitioning Structured Grids with Inhomogeneous Workload. 135-151
  Electronic Edition (link) BibTeX
• Pranay Chaudhuri:
  Parallel Incremental Algorithms for Analyzing Activity Networks. 153-165
  Electronic Edition (link) BibTeX
• Sumanta Guha:
  Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*. 167-185
  Electronic Edition (link) BibTeX

Volume 13, Number 1, 1998

• Yi Pan, Keqin Li, Si-Qing Zheng:
  Fast nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. 1-25
  Electronic Edition (link) BibTeX
• Guillaume Luce, Jean Frédéric Myoupo:
  Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences. 27-52
  Electronic Edition (link) BibTeX
• Panayotis E. Fouliras, K. G. Margartis:
  A Parallel Demand-driven Simulation Algorithm for SIMD Computers. 53-73
  Electronic Edition (link) BibTeX
• J. M. Badía, A. M. Vidal:
  Parallel Algorithms to Compute the Eigenvalues and Eigenvectors Ofsymmetric Toeplitz Matrices. 75-93
  Electronic Edition (link) BibTeX