Xiaobo Li Nearest neighbor classification on two types of SIMD machines. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:381-407 [Journal]

Ilan Bar-On Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:409-417 [Journal]

Stefan Bondeli Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:419-434 [Journal]

Fridrich Sloboda A projection method of the Cimmino type for linear algebraic systems. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:435-442 [Journal]

Éric D. Taillard Robust taboo search for the quadratic assignment problem. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:443-455 [Journal]

Yen-Chun Lin An FP-based tool for the synthesis of regular array algorithms. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:457-470 [Journal]

Sajal K. Das, Cui-Qing Yang Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:527-551 [Journal]

Giorgio Pini A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:553-561 [Journal]