 | 2007 |
| 9 |  | Stanley C. Eisenstat,
Joseph W. H. Liu:
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Analysis Applications 29(4): 1363-1381 (2007) |
| 2005 |
| 8 |  | Stanley C. Eisenstat,
Joseph W. H. Liu:
The Theory of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Analysis Applications 26(3): 686-705 (2005) |
| 1989 |
| 7 |  | C. Ashcraft,
Stanley C. Eisenstat,
J. Liu,
Andrew H. Sherman:
Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization.
PPSC 1989: 55-56 |
| 6 |  | Stanley C. Eisenstat:
Comments on scheduling parallel iterative methods on multiprocessor systems II.
Parallel Computing 11(2): 241-244 (1989) |
| 1984 |
| 5 |  | Jack Dongarra,
Stanley C. Eisenstat:
Squeezing the most out of an algorithm in CRAY FORTRAN.
ACM Trans. Math. Softw. 10(3): 219-230 (1984) |
| 1980 |
| 4 |  | Richard A. DeMillo,
Stanley C. Eisenstat,
Richard J. Lipton:
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem.
J. ACM 27(1): 123-127 (1980) |
| 1978 |
| 3 |  | Richard A. DeMillo,
Stanley C. Eisenstat,
Richard J. Lipton:
Preserving Average Proximity in Arrays.
Commun. ACM 21(3): 218-231 (1978) |
| 1976 |
| 2 |  | Richard J. Lipton,
Stanley C. Eisenstat,
Richard A. DeMillo:
Space and Time Hierarchies for Classes of Control Structures and Data Structures.
J. ACM 23(4): 720-732 (1976) |
| 1975 |
| 1 |  | Richard J. Lipton,
Stanley C. Eisenstat,
Richard A. DeMillo:
The Complexity of Control Structures and Data Structures
STOC 1975: 186-193 |