| 2009 |
|---|
| 24 | EE | Jean-Guillaume Dumas,
Clément Pernet,
B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices
CoRR abs/0901.4747: (2009) |
| 2007 |
|---|
| 23 | EE | John P. May,
B. David Saunders,
Zhendong Wan:
Efficient matrix rank computation with application to the study of strongly regular graphs.
ISSAC 2007: 277-284 |
| 22 | EE | Bruce W. Char,
B. David Saunders,
Bryan Youse:
LinBox and future high performance computer algebra.
PASCO 2007: 102-103 |
| 21 | EE | John P. May,
B. David Saunders,
David Harlan Wood:
Numerical techniques for computing the inertia of products of matrices of rational numbers.
SNC 2007: 125-132 |
| 2005 |
|---|
| 20 | EE | Jeffrey Adams,
B. David Saunders,
Zhendong Wan:
Signature of symmetric rational matrices and the unitary dual of lie groups.
ISSAC 2005: 13-20 |
| 2004 |
|---|
| 19 | EE | B. David Saunders,
Zhendong Wan:
Smith normal form of dense integer matrices fast algorithms into practice.
ISSAC 2004: 274-281 |
| 2003 |
|---|
| 18 | | Jean-Guillaume Dumas,
Frank Heckenbach,
B. David Saunders,
Volkmar Welker:
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.
Algebra, Geometry, and Software Systems 2003: 177-206 |
| 2001 |
|---|
| 17 | EE | B. David Saunders:
Black box methods for least squares problems.
ISSAC 2001: 297-302 |
| 16 | | Jean-Guillaume Dumas,
B. David Saunders,
Gilles Villard:
On Efficient Sparse Integer Matrix Smith Normal Form Computations.
J. Symb. Comput. 32(1/2): 71-99 (2001) |
| 2000 |
|---|
| 15 | EE | Jean-Guillaume Dumas,
B. David Saunders,
Gilles Villard:
Integer Smith form via the valence: experience with large sparse matrices from homology.
ISSAC 2000: 95-105 |
| 1998 |
|---|
| 14 | EE | Mark Giesbrecht,
A. Lobo,
B. David Saunders:
Certifying Inconsistency of Sparse Linear Systems.
ISSAC 1998: 113-119 |
| 1997 |
|---|
| 13 | EE | Yagati N. Lakshman,
B. David Saunders:
Sparse Shifts for Univariate Polynomials.
Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997) |
| 1996 |
|---|
| 12 | EE | Yagati N. Lakshman,
B. David Saunders:
Sparse Shifts for Univariate Polynomia.
Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996) |
| 1995 |
|---|
| 11 | | Hong R. Lee,
B. David Saunders:
Fraction Free Gaussian Elimination for Sparse Matrices.
J. Symb. Comput. 19(5): 393-402 (1995) |
| 10 | | Yagati N. Lakshman,
B. David Saunders:
Sparse Polynomial Interpolation in Nonstandard Bases.
SIAM J. Comput. 24(2): 387-397 (1995) |
| 1994 |
|---|
| 9 | EE | Yagati N. Lakshman,
B. David Saunders:
On Computing Sparse Shifts for Univariate Polynomials.
ISSAC 1994: 108-113 |
| 1991 |
|---|
| 8 | | Erich Kaltofen,
B. David Saunders:
On Wiedemann's Method of Solving Sparse Linear Systems.
AAECC 1991: 29-38 |
| 1989 |
|---|
| 7 | EE | B. David Saunders,
Hong R. Lee,
S. Kamal Abdali:
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm.
ISSAC 1989: 298-307 |
| 1987 |
|---|
| 6 | | Erich Kaltofen,
Mukkai S. Krishnamoorthy,
B. David Saunders:
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices.
EUROCAL 1987: 317-322 |
| 1985 |
|---|
| 5 | | Snorri Agnarsson,
Mukkai S. Krishnamoorthy,
B. David Saunders:
An Algebraic Implementation of Packages.
European Conference on Computer Algebra (2) 1985: 291-302 |
| 4 | | Michael F. Singer,
B. David Saunders,
B. F. Caviness:
An Extension of Liouville's Theorem on Integration in Finite Terms.
SIAM J. Comput. 14(4): 966-990 (1985) |
| 3 | | S. Kamal Abdali,
B. David Saunders:
Transitive Closure and Related Semiring Properties via Eliminants.
Theor. Comput. Sci. 40: 257-274 (1985) |
| 1984 |
|---|
| 2 | | Nikolaos Glinos,
B. David Saunders:
Operational Calculus Technique for Solving Differential Equations.
EUROSAM 1984: 23-34 |
| 1983 |
|---|
| 1 | | Erich Kaltofen,
David R. Musser,
B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor.
SIAM J. Comput. 12(3): 473-483 (1983) |
