 | 2002 |
| 18 |  | Masha Sosonkina,
Donald C. S. Allison,
Layne T. Watson:
Scalability analysis of parallel GMRES implementations.
Parallel Algorithms Appl. 17(4): 263-284 (2002) |
| 1998 |
| 17 |  | Masha Sosonkina,
Donald C. S. Allison,
Layne T. Watson:
Scalable Parallel Implementations of the GMRES Algorithm via Householder Reflections.
ICPP 1998: 396-404 |
| 1997 |
| 16 |  | Masha Sosonkina,
Donald C. S. Allison,
Layne T. Watson:
Scalability of Adaptive GMRES Algorithm.
PPSC 1997 |
| 1993 |
| 15 |  | Amal Chakraborty,
Donald C. S. Allison,
Calvin J. Ribbens,
Layne T. Watson:
The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations.
IEEE Trans. Parallel Distrib. Syst. 4(4): 458-465 (1993) |
| 1992 |
| 14 |  | Donald C. S. Allison,
Kashmira M. Irani,
Calvin J. Ribbens,
Layne T. Watson:
High-dimensional homotopy curve tracking on a shared-memory multiprocessor.
The Journal of Supercomputing 5(4): 347-366 (1992) |
| 1991 |
| 13 |  | Donald C. S. Allison,
Kashmira M. Irani,
Calvin J. Ribbens,
Layne T. Watson:
Shared Memory Parallel Algorithms for Homotopy Curve Tracking.
ICPP (3) 1991: 17-20 |
| 12 |  | Amal Chakraborty,
Donald C. S. Allison,
Calvin J. Ribbens,
Layne T. Watson:
Note on unit tangent vector computation for homotopy curve tracking on a hypercube.
Parallel Computing 17(12): 1385-1395 (1991) |
| 1990 |
| 11 |  | Amal Chakraborty,
Donald C. S. Allison,
Calvin J. Ribbens,
Layne T. Watson:
Parallel Unit Tangent Vector Computation for Homotopy Curve Tracking on a Hypercube.
ACM Conference on Computer Science 1990: 103-108 |
| 10 |  | Amal Chakraborty,
Donald C. S. Allison,
Calvin J. Ribbens,
Layne T. Watson:
Low Dimensional Homotopy Curve Tracking on a Hypercub.
ICPP (3) 1990: 44-51 |
| 1989 |
| 9 |  | Amal Chakraborty,
Donald C. S. Allison,
Calvin J. Ribbens,
Layne T. Watson:
Parallel Homotopy Curve Tracking on a Hypercube.
PPSC 1989: 149-153 |
| 8 |  | Donald C. S. Allison,
Amal Chakraborty,
Layne T. Watson:
Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube.
The Journal of Supercomputing 3(1): 5-20 (1989) |
| 1988 |
| 7 |  | Ritu Chadha,
Donald C. S. Allison:
Partitioning rectilinear figures into rectangles.
ACM Conference on Computer Science 1988: 102-106 |
| 1985 |
| 6 |  | M. T. Noga,
Donald C. S. Allison:
Sorting in Linear Expected Time.
BIT 25(3): 451-465 (1985) |
| 1984 |
| 5 |  | Donald C. S. Allison,
M. T. Noga:
Some Performance Tests of Convex Hull Algorithms.
BIT 24(1): 2-13 (1984) |
| 4 |  | Donald C. S. Allison,
M. T. Noga:
The L1 Travelling Salesman Problem.
Inf. Process. Lett. 18(4): 195-199 (1984) |
| 1982 |
| 3 |  | Donald C. S. Allison,
M. T. Noga:
USORT: An Efficient Hybrid of Distributed Partitioning Sorting.
BIT 22(2): 135-139 (1982) |
| 1980 |
| 2 |  | Donald C. S. Allison,
M. T. Noga:
Selection by Distributive Partitioning.
Inf. Process. Lett. 11(1): 7-8 (1980) |
| 1972 |
| 1 |  | C. A. R. Hoare,
Donald C. S. Allison:
Incomputability.
ACM Comput. Surv. 4(3): 169-178 (1972) |