Donald C. S. Allison

According to our database1, Donald C. S. Allison authored at least 21 papers between 1972 and 2002.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2002
Scalability analysis of parallel GMRES implementations.
Parallel Algorithms Appl., 2002

1999
Parallel Adaptive GMRES Implementations for Homotopy Methods.
SIAM J. Optim., 1999

1998
Scalable Parallel Implementations of the GMRES Algorithm via Householder Reflections.
Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

1997
Scalability of Adaptive GMRES Algorithm.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1993
The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations.
IEEE Trans. Parallel Distributed Syst., 1993

1992
High-dimensional homotopy curve tracking on a shared-memory multiprocessor.
J. Supercomput., 1992

1991
Note on unit tangent vector computation for homotopy curve tracking on a hypercube.
Parallel Comput., 1991

Shared Memory Parallel Algorithms for Homotopy Curve Tracking.
Proceedings of the International Conference on Parallel Processing, 1991

1990
Low Dimensional Homotopy Curve Tracking on a Hypercub.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

Parallel Unit Tangent Vector Computation for Homotopy Curve Tracking on a Hypercube.
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

1989
Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube.
J. Supercomput., 1989

Parallel Homotopy Curve Tracking on a Hypercube.
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989

Parallel homotopy algorithms.
Proceedings of the Computer Trends in the 1990s, 1989

An O(N log N) expected time merge heuristic for the planar ETSP.
Proceedings of the Computer Trends in the 1990s, 1989

1988
Partitioning rectilinear figures into rectangles.
Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1985
Sorting in Linear Expected Time.
BIT, 1985

1984
The L<sub>1</sub> Travelling Salesman Problem.
Inf. Process. Lett., 1984

Some Performance Tests of Convex Hull Algorithms.
BIT, 1984

1982
USORT: An Efficient Hybrid of Distributed Partitioning Sorting.
BIT, 1982

1980
Selection by Distributive Partitioning.
Inf. Process. Lett., 1980

1972
Incomputability.
ACM Comput. Surv., 1972


  Loading...