![]() | ![]() |
1994 | ||
---|---|---|
4 | Nicholas Carriero, David Gelernter, Timothy G. Mattson, Andrew H. Sherman: The Linda® Alternative to Message-Passing Systems. Parallel Computing 20(4): 633-655 (1994) | |
1989 | ||
3 | C. Ashcraft, Stanley C. Eisenstat, J. Liu, Andrew H. Sherman: Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization. PPSC 1989: 55-56 | |
1978 | ||
2 | EE | Andrew H. Sherman: Algorithms for Sparse Gaussian Elimination with Partial Pivoting. ACM Trans. Math. Softw. 4(4): 330-338 (1978) |
1 | EE | Andrew H. Sherman: Algorithm 533: NSPIV, A Fortran Subroutine for Sparse Gaussian Elimination with Partial Pivoting [F4]. ACM Trans. Math. Softw. 4(4): 391-398 (1978) |
1 | C. Ashcraft | [3] |
2 | Nicholas Carriero | [4] |
3 | Stanley C. Eisenstat | [3] |
4 | David Gelernter | [4] |
5 | J. Liu | [3] |
6 | Timothy G. Mattson | [4] |